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.
42nd International Symposium on Computational Geometry (SoCG 2026) , pages =
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
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.