Distance queries over dynamic interval graphs
From MaRDI portal
Cites work
- A new approach to dynamic all pairs shortest paths
- A unified approach to approximating resource allocation and scheduling
- Algorithm Theory - SWAT 2004
- Algorithms and hardness for linear algebra on geometric graphs
- All-pairs shortest paths in geometric intersection graphs
- Approximate distance oracle in \(O(n ^{2})\) time and \(O(n)\) space for chordal graphs
- Approximate shortest paths and distance oracles in weighted unit-disk graphs
- Distance oracles beyond the Thorup-Zwick bound
- Finding triangles and other small subgraphs in geometric intersection graphs
- Fully dynamic representations of interval graphs
- Hop-spanners for geometric intersection graphs
- scientific article; zbMATH DE number 7765383 (Why is no real title available?)
- Maintaining information in fully dynamic trees with top trees
- On approximate distance labels and routing schemes with affine stretch
- On the succinct representation of equivalence classes
- Optimal approximate distance oracle for planar graphs
- Optimal Distance Labeling for Interval Graphs and Related Graph Families
- Solving the all-pair shortest path query problem on interval and circular-arc graphs
- Succinct data structures for chordal graphs
- Succinct encodings for families of interval graphs
- The level ancestor problem simplified
- Time and space efficient representations of distributive lattices
- Towards sub-quadratic diameter computation in geometric intersection graphs
- Unifying and strengthening hardness for dynamic problems via the online matrix-vector multiplication conjecture
- Well-Separated Pair Decomposition for the Unit-Disk Graph Metric and Its Applications
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 Q6953202)
