Unified all-pairs shortest path algorithms in the chordal hierarchy

Authors:
K. Han;Chandra N. Sekharan;R. Sridhar
Affiliations:
-;-;-
Venue:
Discrete Applied Mathematics
Year:
1997

Citing 0
Cited 6

Fast approximation of centrality

SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Estimating All Pairs Shortest Paths in Restricted Graph Families: A Unified Approach

WG '01 Proceedings of the 27th International Workshop on Graph-Theoretic Concepts in Computer Science
Estimating all pairs shortest paths in restricted graph families: a unified approach

Journal of Algorithms
O(1) query time algorithm for all pairs shortest distances on permutation graphs

Discrete Applied Mathematics
Estimating all pairs shortest paths in restricted graph families: a unified approach

Journal of Algorithms
Computing all-pairs shortest paths by leveraging low treewidth

Journal of Artificial Intelligence Research

Quantified Score

Hi-index	0.04

Visualization

Abstract