Graphs without large apples and the maximum weight independent set problem
From MaRDI portal
Recommendations
- Independent sets of maximum weight in apple-free graphs
- Independent Sets of Maximum Weight in Apple-Free Graphs
- On the maximum weight independent set problem in graphs without induced cycles of length at least five
- The weighted maximum independent set problem in permutation graphs
- Maximum weight independent sets in hole- and dart-free graphs
- Maximum weightk-independent set problem on permutation graphs
- On independent vertex sets in subclasses of apple-free graphs
- Maximum weight independent sets in hole- and co-chair-free graphs
- Maximum weight independent sets in odd-hole-free graphs without dart or without bull
- Maximum weighted independent sets on transitive graphs and applications
Cites work
- scientific article; zbMATH DE number 3882470 (Why is no real title available?)
- scientific article; zbMATH DE number 3513839 (Why is no real title available?)
- scientific article; zbMATH DE number 6783420 (Why is no real title available?)
- A New Algorithm for Generating All the Maximal Independent Sets
- A New Algorithm for the Maximum Weighted Stable Set Problem in Claw-Free Graphs
- A REVISION OF MINTY'S ALGORITHM FOR FINDING A MAXIMUM WEIGHT STABLE SET OF A CLAW-FREE GRAPH
- A partial k-arboretum of graphs with bounded treewidth
- A polynomial algorithm to find an independent set of maximum weight in a fork-free graph
- Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph
- An algorithm for finding clique cut-sets
- An upper bound on the number of cliques in a graph
- Claw-free graphs. I: Orientable prismatic graphs
- Claw-free graphs. II: Non-orientable prismatic graphs
- Claw-free graphs. III: Circular interval graphs
- Claw-free graphs. IV: Decomposition theorem
- Claw-free graphs. V. Global structure
- Decomposition by clique separators
- Diameter and treewidth in minor-closed graph families, revisited
- Graph minors. V. Excluding a planar graph
- Graph searching and a min-max theorem for tree-width
- Independent sets of maximum weight in apple-free graphs
- Linear time algorithms for NP-hard problems restricted to partial k- trees
- Matching theory
- Maximum independent sets in graphs of low degree
- Maximum matching and a polyhedron with 0,1-vertices
- Maximum regular induced subgraphs in 2P₃-free graphs
- On clique separators, nearly chordal graphs, and the Maximum Weight Stable Set Problem
- On maximal independent sets of vertices in claw-free graphs
- On the stability number of AH‐free graphs
- Polynomial algorithm for finding the largest independent sets in graphs without forks
- Recent developments on graphs of bounded clique-width
- The Maximum Independent Set Problem in Planar Graphs
- The intersection graphs of subtrees in trees are exactly the chordal graphs
- Treewidth for graphs with small chordality
Cited in
(9)- Set graphs. IV. Further connections with claw-freeness
- On independent vertex sets in subclasses of apple-free graphs
- Combining decomposition approaches for the maximum weight stable set problem
- Maximum Weight Independent Sets in ( $$S_{1,1,3}$$ , bull)-free Graphs
- Weighted independent sets in a subclass of P₆-free graphs
- On the maximum independent set problem in subclasses of subcubic graphs
- Independent sets of maximum weight in apple-free graphs
- Independent Sets of Maximum Weight in Apple-Free Graphs
- Independent Sets in Classes Related to Chair-Free Graphs
This page was built for publication: Graphs without large apples and the maximum weight independent set problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q742580)
