Synapse
⌘+K
Synapse
PulseExploreClubsResearchersJournals
Instagram
HomeClubsExplore
May 29, 2026Open Access

Charting the Diameter Computation Landscape of Intersection Graphs in 3D and Above

View Full Paper
Ask AI
Bookmark
Share

Authors

TCTimothy M. ChanHCHsien-Chih ChangJGJie Gao

Discussion

Loading...

Member takes

Overview

Randomized trial reveals new algorithms for diameter computation in 3D intersection graphs, indicating progress in complexity analysis.

Key Points

  • This research aims to explore and improve the computation of graph diameter in three and higher dimensions, especially for intersection graphs.
  • Developed a subquadratic-time algorithm for determining Diameter-3 of unit cubes in 3D.
  • Established lower bounds for Diameter-3 of unit balls under the Orthogonal Vector hypothesis.
  • Created a near-linear-time algorithm for Diameter-2 of unit cubes in 3D.
  • Presented the first subquadratic-time algorithm for Diameter-3 of unit cubes in 3D.
  • Achieved a truly subquadratic-time lower bound for Diameter-3 of unit balls under the OV hypothesis.
  • Developed a near-linear-time algorithm for Diameter-2 of unit cubes in 3D.

Cite This Study

Chan et al. (2026) studied this question.

synapsesocial.com/papers/6a192dd1fab5b468c4416c37https://doi.org/10.4230/lipics.socg.2026.29
View Full Paper
Ask AI
Bookmark
Share