Matches in SemOpenAlex for { <https://semopenalex.org/work/W2893288980> ?p ?o ?g. }
Showing items 1 to 70 of
70
with 100 items per page.
- W2893288980 abstract "The notion of augmenting graphs generalizes Berge’s idea of augmenting chains, which was used by Edmonds in his celebrated so-called Blossom Algorithm for the maximum matching problem (Edmonds, Can J Math 17:449–467, 1965). This method then was developed for more general maximum independent set (MIS) problem, first for claw-free graphs (Minty, J Comb Theory Ser B 28(3):284–304, 1980; Sbihi, Discret Math 29(1):53–76, 1980). Then the method was used extensively for various special cases, for example, S1,1,2 (or fork)-free graphs (Alekseev, Discret Anal Oper Res Ser 1:3–19, 1999), subclasses of P5 free graphs (Boliac and Lozin, Discret Appl Math 131(3):567–575, 2003; Gerber et al., Discret Appl Math 132(1–3):109–119, 2004; Mosca, Discret Appl Math 132(1–3):175–183, 2004; Lozin and Mosca, Inf Process Lett 109(6):319–324, 2009), P6-free graphs (Mosca, Discuss Math Graph Theory 32(3):387–401, 2012), S1,2,l-free graphs (Hertz et al., Inf Process Lett 86(3):311–316, 2003; Hertz and Lozin, The maximum independent set problem and augmenting graphs. In: Graph theory and combinatorial optimization. Springer Science and Business Media, New York, pp. 69–99, 2005), S1,2,5-free graphs (Lozin and Milanic, Discret Appl Math 156(13):2517–2529, 2008), and for S1,1,3-free graphs (Dabrowski et al., Graphs Comb 32(4):1339–1352, 2016). In this paper, we will extend the method for some more general graph classes. Our objective is combining these approaches to apply this technique to develop polynomial time algorithms for the MIS problem in some special subclasses of S2,2,5-free graphs, extending in this way different known results. Moreover, we also consider the augmenting technique for some other combinatorial graph-theoretical problems, for example maximum induced matching, maximum multi-partite induced subgraphs, maximum dissociative set, etc." @default.
- W2893288980 created "2018-10-05" @default.
- W2893288980 creator A5040151976 @default.
- W2893288980 date "2018-01-01" @default.
- W2893288980 modified "2023-09-27" @default.
- W2893288980 title "Combinatorial and Graph-Theoretical Problems and Augmenting Technique" @default.
- W2893288980 cites W1575434249 @default.
- W2893288980 cites W1869170457 @default.
- W2893288980 cites W1963707128 @default.
- W2893288980 cites W1988197393 @default.
- W2893288980 cites W1989632159 @default.
- W2893288980 cites W1991000585 @default.
- W2893288980 cites W1998462868 @default.
- W2893288980 cites W2000312279 @default.
- W2893288980 cites W2001258629 @default.
- W2893288980 cites W2023377256 @default.
- W2893288980 cites W2028927094 @default.
- W2893288980 cites W2048652909 @default.
- W2893288980 cites W2052790720 @default.
- W2893288980 cites W2059639406 @default.
- W2893288980 cites W2072480005 @default.
- W2893288980 cites W2079563996 @default.
- W2893288980 cites W2092129537 @default.
- W2893288980 cites W2106133486 @default.
- W2893288980 cites W2119626000 @default.
- W2893288980 cites W2197961740 @default.
- W2893288980 cites W2342695705 @default.
- W2893288980 cites W2400813871 @default.
- W2893288980 cites W4210377846 @default.
- W2893288980 cites W4233756358 @default.
- W2893288980 doi "https://doi.org/10.1007/978-3-319-94830-0_9" @default.
- W2893288980 hasPublicationYear "2018" @default.
- W2893288980 type Work @default.
- W2893288980 sameAs 2893288980 @default.
- W2893288980 citedByCount "0" @default.
- W2893288980 crossrefType "book-chapter" @default.
- W2893288980 hasAuthorship W2893288980A5040151976 @default.
- W2893288980 hasConcept C114614502 @default.
- W2893288980 hasConcept C118615104 @default.
- W2893288980 hasConcept C33923547 @default.
- W2893288980 hasConceptScore W2893288980C114614502 @default.
- W2893288980 hasConceptScore W2893288980C118615104 @default.
- W2893288980 hasConceptScore W2893288980C33923547 @default.
- W2893288980 hasLocation W28932889801 @default.
- W2893288980 hasOpenAccess W2893288980 @default.
- W2893288980 hasPrimaryLocation W28932889801 @default.
- W2893288980 hasRelatedWork W1983908928 @default.
- W2893288980 hasRelatedWork W2029095423 @default.
- W2893288980 hasRelatedWork W2046560739 @default.
- W2893288980 hasRelatedWork W2051576617 @default.
- W2893288980 hasRelatedWork W2075051911 @default.
- W2893288980 hasRelatedWork W2151055616 @default.
- W2893288980 hasRelatedWork W2885014190 @default.
- W2893288980 hasRelatedWork W2890307972 @default.
- W2893288980 hasRelatedWork W2937703176 @default.
- W2893288980 hasRelatedWork W2949586199 @default.
- W2893288980 hasRelatedWork W2963355426 @default.
- W2893288980 hasRelatedWork W2963418598 @default.
- W2893288980 hasRelatedWork W2963838695 @default.
- W2893288980 hasRelatedWork W3017711003 @default.
- W2893288980 hasRelatedWork W3025896403 @default.
- W2893288980 hasRelatedWork W3084017792 @default.
- W2893288980 hasRelatedWork W3099640877 @default.
- W2893288980 hasRelatedWork W3103904697 @default.
- W2893288980 hasRelatedWork W3132193000 @default.
- W2893288980 hasRelatedWork W3135451832 @default.
- W2893288980 isParatext "false" @default.
- W2893288980 isRetracted "false" @default.
- W2893288980 magId "2893288980" @default.
- W2893288980 workType "book-chapter" @default.