All-pairs-shortest-length on strongly chordal graphs

Authors:
V. Balachandhran;C. Pandu Rangan
Affiliations:
-;-
Venue:
Discrete Applied Mathematics
Year:
1996

Citing 0
Cited 4

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
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