Distance queries over dynamic interval graphs
DOI10.1016/J.COMGEO.2024.102103zbMATH Open1543.05028MaRDI QIDQ6577442
Meng He, Jingbang Chen, Kaiyu Wu, Daniel J. Zhang, J. Ian Munro, Richard Peng
Publication date: 23 July 2024
Published in: Computational Geometry (Search for Journal in Brave)
Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Distance in graphs (05C12) Graph algorithms (graph-theoretic aspects) (05C85) Data structures (68P05) Information storage and retrieval of data (68P20) Approximation algorithms (68W25) Graph operations (line graphs, products, etc.) (05C76)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- The level ancestor problem simplified
- Fully dynamic representations of interval graphs
- On the succinct representation of equivalence classes
- The intersection graphs of subtrees in trees are exactly the chordal graphs
- Succinct encodings for families of interval graphs
- Unifying and Strengthening Hardness for Dynamic Problems via the Online Matrix-Vector Multiplication Conjecture
- On Approximate Distance Labels and Routing Schemes with Affine Stretch
- Optimal Distance Labeling for Interval Graphs and Related Graph Families
- Solving the all-pair shortest path query problem on interval and circular-arc graphs
- All-pairs shortest paths in geometric intersection graphs
- Approximate Distance Oracle in O(n2) Time and O(n) Space for Chordal Graphs
- Algorithm Theory - SWAT 2004
- Distance Oracles beyond the Thorup--Zwick Bound
- A new approach to dynamic all pairs shortest paths
- Well-Separated Pair Decomposition for the Unit-Disk Graph Metric and Its Applications
- A unified approach to approximating resource allocation and scheduling
- Finding triangles and other small subgraphs in geometric intersection graphs
- Towards sub-quadratic diameter computation in geometric intersection graphs
- Hop-spanners for geometric intersection graphs
This page was built for publication: Distance queries over dynamic interval graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6577442)
