On independent vertex sets in subclasses of apple-free graphs
DOI10.1007/S00453-008-9176-0zbMATH Open1187.05050OpenAlexW1972321305MaRDI QIDQ848838FDOQ848838
Authors: Tilo Klembt, Raffaele Mosca, Andreas Brandstädt, Vadim Lozin 
Publication date: 23 February 2010
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-008-9176-0
Recommendations
- Independent Sets of Maximum Weight in Apple-Free Graphs
- Graphs without large apples and the maximum weight independent set problem
- Independent sets of maximum weight in apple-free graphs
- Maximum weight independent sets in classes related to claw-free graphs
- Independent sets in some classes of \(S_{i,j,k}\)-free graphs
efficient algorithmsclique separatorsmaximum weight independent set problemapple-free graphsnearly chordal graphsnearly perfect graphs
Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Paths and cycles (05C38)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Graph Classes: A Survey
- Decomposition by clique separators
- The ellipsoid method and its consequences in combinatorial optimization
- Modular decomposition and transitive orientation
- Efficient graph representations
- The strong perfect graph theorem
- The structure of claw-free graphs
- On maximal independent sets of vertices in claw-free graphs
- Title not available (Why is that?)
- Stable sets in certain \(P_6\)-free graphs
- Stable sets in two subclasses of banner-free graphs
- Title not available (Why is that?)
- A Linear Recognition Algorithm for Cographs
- New applications of clique separator decomposition for the maximum weight stable set problem
- A note on \(\alpha\)-redundant vertices in graphs
- Title not available (Why is that?)
- A REVISION OF MINTY'S ALGORITHM FOR FINDING A MAXIMUM WEIGHT STABLE SET OF A CLAW-FREE GRAPH
- Title not available (Why is that?)
- The strong perfect graph conjecture for pan-free graphs
- On the vertex packing problem
- Stable sets of maximum weight in (\(P_{7}\), banner)-free graphs
- Augmenting graphs for independent sets
- The struction of a graph: Application to CN-free graphs
- On Hamiltonicity of \{claw, net\}-free graphs
- Stability in \(P_5\)- and banner-free graphs
- On linear and circular structure of (claw, net)-free graphs
- Linear time algorithms for Hamiltonian problems on (claw, net)-free graphs
- Robust algorithms for the stable set problem
- On Clique Separators, Nearly Chordal Graphs, and the Maximum Weight Stable Set Problem
Cited In (13)
- Maximum weight independent sets in hole- and co-chair-free graphs
- Set graphs. IV. Further connections with claw-freeness
- Graphs without large apples and the maximum weight independent set problem
- Combining decomposition approaches for the maximum weight stable set problem
- On atomic structure of \(P_5\)-free subclasses and maximum weight independent set problem
- Weighted independent sets in a subclass of \(P_6\)-free graphs
- Independent domination in finitely defined classes of graphs: polynomial algorithms
- Addendum to: ``Maximum weight independent sets in hole- and co-chair-free graphs
- Independent sets of maximum weight in apple-free graphs
- Weighted efficient domination in two subclasses of \(P_6\)-free graphs
- On distance-3 matchings and induced matchings
- Independent Sets of Maximum Weight in Apple-Free Graphs
- Maximum weight independent sets in odd-hole-free graphs without dart or without bull
This page was built for publication: On independent vertex sets in subclasses of apple-free graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q848838)
