Geodesic treewidth and row treewidth are separated by non-implication, differing complexities (poly-time vs NP-hard for tw=2 case; XP vs none), one-way boundedness implication, overall NP-hardness for geodesic treewidth, and planar lower bound raised to 5.
Upper bounds on the size of obstructions and intertwines.J
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
verdicts
UNVERDICTED 2roles
background 1polarities
unclear 1representative citing papers
The paper overviews universal obstructions as a unifying framework for graph parameters, surveys existing results across many parameters, and offers some unifying classification results.
citing papers explorer
-
Separating Geodesic Structure and Product Structure
Geodesic treewidth and row treewidth are separated by non-implication, differing complexities (poly-time vs NP-hard for tw=2 case; XP vs none), one-way boundedness implication, overall NP-hardness for geodesic treewidth, and planar lower bound raised to 5.
-
An Overview of Universal Obstructions for Graph Parameters
The paper overviews universal obstructions as a unifying framework for graph parameters, surveys existing results across many parameters, and offers some unifying classification results.