Proves that (treewidth, clique)-bounded graph classes have poly-logarithmic tree-independence number via independence-containers, a generalization of maximal cliques.
Width parameters beyond tree-width and their applications.The Computer Journal, 51(3):326–362
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
(Treewidth, Clique)-Boundedness and Poly-logarithmic Tree-Independence
Proves that (treewidth, clique)-bounded graph classes have poly-logarithmic tree-independence number via independence-containers, a generalization of maximal cliques.