Maximum weight independent sets in classes related to claw-free graphs
From MaRDI portal
(Redirected from Publication:344862)
Recommendations
- Maximum Weight Independent Sets in ( $$S_{1,1,3}$$ , bull)-free Graphs
- Independent sets in some classes of \(S_{i,j,k}\)-free graphs
- Maximum weight independent set for \(\ell\)claw-free graphs in polynomial time
- Independent Sets in Classes Related to Chair-Free Graphs
- Weighted independent sets in classes of \(P_6\)-free graphs
Cites work
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 3445275 (Why is no real title available?)
- A Linear Recognition Algorithm for Cographs
- A polynomial algorithm to find an independent set of maximum weight in a fork-free graph
- Data Mining with optimized two-dimensional association rules
- Decomposition by clique separators
- Finding augmenting chains in extensions of claw-free graphs
- Graph Classes: A Survey
- Independent set in \(P_5\)-free graphs in polynomial time
- Independent sets in extensions of 2\(K_{2}\)-free graphs
- Independent sets of maximum weight in apple-free graphs
- Maximum weight independent sets in hole- and dart-free graphs
- On atomic structure of \(P_5\)-free subclasses and maximum weight independent set problem
- On maximal independent sets of vertices in claw-free graphs
- On the homogeneous representation of interval graphs
- Optimizing Bull-Free Perfect Graphs
- Recognizing bull-free perfect graphs
- Stability number of bull- and chair-free graphs revisited
- Stable sets in two subclasses of banner-free graphs
- The Erdős-Hajnal conjecture for bull-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
(23)- A \(d/2\) approximation for maximum weight independent set in \(d\)-claw free graphs
- Maximum weight independent sets in odd-hole-free graphs without dart or without bull
- Coloring graph classes with no induced fork via perfect divisibility
- A polynomial algorithm to find an independent set of maximum weight in a fork-free graph
- Parameterized complexity of independent set in \(H\)-free graphs
- Weighted independent sets in a subclass of \(P_6\)-free graphs
- Maximum weight independent sets for (\(S_{1,2,4}\), triangle)-free graphs in polynomial time
- Parameterized complexity of independent set in H-free graphs
- Algorithm to find a maximum 2-packing set in a cactus
- Independent Sets in Classes Related to Chair-Free Graphs
- scientific article; zbMATH DE number 1617260 (Why is no real title available?)
- Parameterized complexity of the weighted independent set problem beyond graphs of bounded clique number
- Maximum Weight Independent Sets in ( $$S_{1,1,3}$$ , bull)-free Graphs
- Independent sets of maximum weight in (\(p,q\))-colorable graphs.
- Independent sets in extensions of 2\(K_{2}\)-free graphs
- On independent vertex sets in subclasses of apple-free graphs
- Maximum weight independent sets in (\(P_6\), co-banner)-free graphs
- Maximum weight independent sets in hole- and dart-free graphs
- Independent sets in some classes of \(S_{i,j,k}\)-free graphs
- Maximum weight independent set for \(\ell\)claw-free graphs in polynomial time
- Weighted independent sets in classes of \(P_6\)-free graphs
- Addendum to: ``Maximum weight independent sets in hole- and co-chair-free graphs
- Weighted efficient domination in two subclasses of \(P_6\)-free graphs
This page was built for publication: Maximum weight independent sets in classes related to claw-free graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q344862)
