An optimal algorithm to solve the all-pair shortest path problem on interval graphs
From MaRDI portal
Publication:3989542
DOI10.1002/net.3230220103zbMath0761.90096MaRDI QIDQ3989542
C. Pandu Rangan, R. Ravi, Madhav V. Marathe
Publication date: 28 June 1992
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.3230220103
90C35: Programming involving graphs or networks
Related Items
Efficient algorithms for centers and medians in interval and circular-arc graphs, Optimal sequential and parallel algorithms for computing the diameter and the center of an interval graph, \(O(1)\) query time algorithm for all pairs shortest distances on permutation graphs, Computing the average distance of an interval graph, Unified all-pairs shortest path algorithms in the chordal hierarchy, An optimal parallel algorithm for solving all-pairs shortest paths problem on circular-arc graphs, An optimal algorithm for shortest paths on weighted interval and circular-arc graphs, with applications, Algorithms for Interval Structures with Applications
Cites Work