scientific article; zbMATH DE number 913360

DOI<215::AID-NET6>3.0.CO;2-L 10.1002/(SICI)1097-0037(199605)27:3<215::AID-NET6>3.0.CO;2-LzbMath0851.90127MaRDI QIDQ4887753

Prakash Mirchandani

Publication date: 25 November 1996

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

interval graphall-pairs shortest path problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60)

Related Items

Solving the all-pairs-shortest-length problem on chordal bipartite graphs ⋮ A survey of the all-pairs shortest paths problem and its variants in graphs ⋮ \(O(1)\) query time algorithm for all pairs shortest distances on permutation graphs ⋮ An optimal parallel algorithm for solving all-pairs shortest paths problem on circular-arc graphs ⋮ O(1) QUERY TIME ALGORITHM FOR ALL PAIRS SHORTEST DISTANCES ON INTERVAL GRAPHS