Induced subgraphs of bounded treewidth and the container method

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cites Work

Title not available (Why is that?)
Title not available (Why is that?)
Clique separator decomposition of hole-free and diamond-free graphs and algorithmic consequences
Hypergraph containers
Maximum weight independent sets in odd-hole-free graphs without dart or without bull
Maximum weight independent sets in hole- and dart-free graphs
Maximum weight independent sets in hole- and co-chair-free graphs
The strong perfect graph theorem
The ellipsoid method and its consequences in combinatorial optimization
Automatic generation of linear-time algorithms from predicate calculus descriptions of problems on recursively constructed graph families
Listing all potential maximal cliques of a graph
Minimum connected transversals in graphs: new hardness results and tractable cases using the price of connectivity
Independent feedback vertex set for \(P_5\)-free graphs
Upper bounds to the clique width of graphs
Covering minimal separators and potential maximal cliques in \(P_t\)-free graphs
Efficiently decomposing, recognizing and triangulating hole-free graphs without diamonds
Treewidth and minimum fill-in: Grouping the minimal separators
Large Induced Subgraphs via Triangulations and CMSO
Finding Induced Subgraphs via Minimal Triangulations
A Linear Recognition Algorithm for Cographs
Complexity of Finding Embeddings in a k-Tree
Reducibility among Combinatorial Problems
Independent Set in P₅-Free Graphs in Polynomial Time
On the Maximum Weight Independent Set Problem in Graphs without Induced Cycles of Length at Least Five
Independent Sets of Maximum Weight in Apple-Free Graphs
On cycle transversals and their connected variants in the absence of a small linear forest
Polynomial-time Algorithm for Maximum Weight Independent Set on P ₆ -free Graphs
Finding large induced sparse subgraphs in c _>t -free graphs in quasipolynomial time
Quasi-polynomial-time algorithm for independent set in \(P_t\)-free graphs via shrinking the space of induced paths
Sparse induced subgraphs in \(P_6\)-free graphs

This page was built for publication: Induced subgraphs of bounded treewidth and the container method

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