On atomic structure of P₅-free subclasses and maximum weight independent set problem
From MaRDI portal
(Redirected from Publication:385962)
On atomic structure of \(P 5\)-free subclasses and maximum weight independent set problem
On atomic structure of \(P 5\)-free subclasses and maximum weight independent set problem
Recommendations
- New applications of clique separator decomposition for the maximum weight stable set problem
- Fundamentals of Computation Theory
- Clique separator decomposition of hole-free and diamond-free graphs and algorithmic consequences
- Maximum independent sets in subclasses of \(P_{5}\)-free graphs
- scientific article; zbMATH DE number 7743715
Cites work
- scientific article; zbMATH DE number 3896983 (Why is no real title available?)
- scientific article; zbMATH DE number 3908479 (Why is no real title available?)
- scientific article; zbMATH DE number 3513839 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 3445275 (Why is no real title available?)
- (\(P_{5}\), diamond)-free graphs revisited: Structure and linear time optimization.
- P4-Reducible Graphs-Class of Uniquely Tree-Representable Graphs
- A Linear Recognition Algorithm for Cographs
- A polynomial algorithm to find an independent set of maximum weight in a fork-free graph
- Clique separator decomposition of hole-free and diamond-free graphs and algorithmic consequences
- Data Mining with optimized two-dimensional association rules
- Decomposition by clique separators
- Efficient algorithms for minimum weighted colouring of some classes of perfect graphs
- Graph Classes: A Survey
- Independent sets of maximum weight in apple-free graphs
- Maximum weight independent sets in hole- and co-chair-free graphs
- Maximum weight independent sets in hole- and dart-free graphs
- New applications of clique separator decomposition for the maximum weight stable set problem
- New graph classes of bounded clique-width
- On algorithms for (\(P_5\), gem)-free graphs
- On clique separators, nearly chordal graphs, and the Maximum Weight Stable Set Problem
- On diameters and radii of bridged graphs
- On independent vertex sets in subclasses of apple-free graphs
- On maximal independent sets of vertices in claw-free graphs
- On the stable set problem in special \(P_{5}\)-free graphs
- On the structure and stability number of \(P_{5}\)- and co-chair-free graphs
- On variations of \(P_{4}\)-sparse graphs
- Polynomial algorithms for the maximum stable set problem on particular classes of \(P_{5}\)-free graphs
- The complexity of generalized clique packing
- The ellipsoid method and its consequences in combinatorial optimization
- Vertex disjoint paths for dispatching in railways
Cited in
(11)- New applications of clique separator decomposition for the maximum weight stable set problem
- Combining decomposition approaches for the maximum weight stable set problem
- Weighted independent sets in a subclass of \(P_6\)-free graphs
- Maximum weight independent sets in classes related to claw-free graphs
- Independent Sets in Classes Related to Chair-Free Graphs
- Special data structures for problems on graphs associated with the notion of clique or with modular decomposition
- More results on weighted independent domination
- Independent sets in some classes of \(S_{i,j,k}\)-free graphs
- Weighted independent sets in classes of \(P_6\)-free graphs
- Addendum to: ``Maximum weight independent sets in hole- and co-chair-free graphs
- Fundamentals of Computation Theory
This page was built for publication: On atomic structure of \(P_5\)-free subclasses and maximum weight independent set problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q385962)
