scientific article; zbMATH DE number 2246590

MaRDI QIDQ5717953zbMATH OpenFDO

Authors Alain Hertz, Vadim Lozin

Publication date 13 January 2006

zbMATH Keywords

algorithmaugmenting pathclaw-free graphstable set

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Structural characterization of families of graphs (05C75) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• Augmenting graphs for independent sets
• Combinatorics and algorithms for augmenting graphs
• Combinatorial and graph-theoretical problems and augmenting technique
• On finding augmenting graphs
• Augmenting approach for some maximum set problems

Cited in

(10)

• Finding augmenting chains in extensions of claw-free graphs
• Extending the MAX algorithm for maximum independent set
• New sufficient conditions for \(\alpha\)-redundant vertices
• The maximum independent set problem in subclasses of subcubic graphs
• Combinatorics and algorithms for augmenting graphs
• Augmenting approach for some maximum set problems
• The maximum independent set problem in subclasses of \(S_{i, j, k}\)-free graphs
• A sufficient condition to extend polynomial results for the maximum independent set problem
• The max quasi-independent set Problem
• Augmenting graphs for independent sets

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5717953)