Conditional lower bound rules out O(n^{2-ε}) algorithms for isometric/convex subgraph testing on sparse graphs; subquadratic time for planar graphs and near-linear time for bounded-treewidth and certain plane graphs.
36 Ladislav Nebeský
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Testing whether a subgraph is convex or isometric
Conditional lower bound rules out O(n^{2-ε}) algorithms for isometric/convex subgraph testing on sparse graphs; subquadratic time for planar graphs and near-linear time for bounded-treewidth and certain plane graphs.