This work charts a nuanced complexity landscape for diameter computation on 2D intersection graphs, delivering new subquadratic algorithms for some object types and diameter values while proving hardness for others under fine-grained assumptions.
15 Neil Robertson and Paul Seymour
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
verdicts
UNVERDICTED 3representative citing papers
Faster centralized and parallel algorithms for multi-source reachability and approximate distances in directed graphs using shortcuts, hopsets, and rectangular matrix multiplication.
Graphs of treewidth k satisfy α_c(G) ≥ c/(c+k+1)n with matching upper-bound constructions; the bound improves to c/(c+k)n when c≤2 or k=1 and to 5/9 n when c=3 and k=2.
citing papers explorer
-
Charting the Diameter Computation Landscape on Intersection Graphs in the Plane
This work charts a nuanced complexity landscape for diameter computation on 2D intersection graphs, delivering new subquadratic algorithms for some object types and diameter values while proving hardness for others under fine-grained assumptions.
-
Faster Multi-Source Reachability and Approximate Distances via Shortcuts, Hopsets and Matrix Multiplication
Faster centralized and parallel algorithms for multi-source reachability and approximate distances in directed graphs using shortcuts, hopsets, and rectangular matrix multiplication.
-
Clustered independence and bounded treewidth
Graphs of treewidth k satisfy α_c(G) ≥ c/(c+k+1)n with matching upper-bound constructions; the bound improves to c/(c+k)n when c≤2 or k=1 and to 5/9 n when c=3 and k=2.