Solving the all-pair shortest path query problem on interval and circular-arc graphs
From MaRDI portal
Publication:4540051
DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1097-0037(199807)31:4<249::AID-NET5>3.0.CO;2-D" /><249::AID-NET5>3.0.CO;2-D 10.1002/(SICI)1097-0037(199807)31:4<249::AID-NET5>3.0.CO;2-DzbMath1015.68054OpenAlexW2027011267MaRDI QIDQ4540051
No author found.
Publication date: 21 July 2002
Full work available at URL: https://doi.org/10.1002/(sici)1097-0037(199807)31:4<249::aid-net5>3.0.co;2-d
Programming involving graphs or networks (90C35) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Data structures (68P05)
Related Items (18)
Efficient algorithms for centers and medians in interval and circular-arc graphs ⋮ Unified all-pairs shortest path algorithms in the chordal hierarchy ⋮ \(O(1)\) query time algorithm for all pairs shortest distances on permutation graphs ⋮ An improved algorithm for the \(p\)-center problem on interval graphs with unit lengths ⋮ Succinct encodings for families of interval graphs ⋮ The \(p\)-Maxian problem on interval graphs ⋮ Algorithms for interval structures with applications ⋮ Disconnected cuts in claw-free graphs ⋮ Unnamed Item ⋮ Backup 2-center on interval graphs ⋮ Algorithms for Interval Structures with Applications ⋮ Modelling gateway placement in wireless networks: geometric \(k\)-centres of unit disc graphs ⋮ An efficient certifying algorithm for the Hamiltonian cycle problem on circular-arc graphs ⋮ Parameterized complexity of diameter ⋮ Localized and compact data-structure for comparability graphs ⋮ O(1) QUERY TIME ALGORITHM FOR ALL PAIRS SHORTEST DISTANCES ON INTERVAL GRAPHS ⋮ Solving the path cover problem on circular-arc graphs by using an approximation algorithm ⋮ Distance Labeling for Permutation Graphs
This page was built for publication: Solving the all-pair shortest path query problem on interval and circular-arc graphs
