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.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.CG 2years
2026 2verdicts
UNVERDICTED 2representative citing papers
SSSP runs in O(n 2^α(n) log² n) expected time for arbitrary pseudodisk graphs and diameter up to additive error 2 in Õ(n^{2-1/14}) time.
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.
-
Single-Source Shortest Paths and Almost Exact Diameter in Pseudodisk Graphs
SSSP runs in O(n 2^α(n) log² n) expected time for arbitrary pseudodisk graphs and diameter up to additive error 2 in Õ(n^{2-1/14}) time.