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

Authors:
Feodor F. Dragan
Affiliations:
Department of Computer Science, Kent State University, Kent, OH
Venue:
Journal of Algorithms
Year:
2005

Citing 39
Cited 2

Distance-hereditary graphs

Journal of Combinatorial Theory Series B
Matrix multiplication via arithmetic progressions

STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Doubly lexical orderings of matrices

SIAM Journal on Computing
Three partition refinement algorithms

SIAM Journal on Computing
Perfect graphs and orthogonally convex covers

SIAM Journal on Discrete Mathematics
Covering orthogonal polygons with star polygons: the perfect graph approach

Journal of Computer and System Sciences
Recognizing visibility graphs of spiral polygons

Journal of Algorithms
On the exponent of the all pairs shortest path problem

SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
On the all-pairs-shortest-path problem

STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Optimal link path queries in a simple polygon

SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Doubly lexical ordering of dense 0–1 matrices

Information Processing Letters
Efficient algorithms for shortest distance queries on special classes of polygons

Theoretical Computer Science - Special issue on design and analysis of geometrical algorithms for robot motion planning and vision
Solving the shortest-paths problem on bipartite permutation graphs efficiently

Information Processing Letters
All-pairs-shortest-length on strongly chordal graphs

Discrete Applied Mathematics
Unified all-pairs shortest path algorithms in the chordal hierarchy

Discrete Applied Mathematics
The algorithmic use of hypertree structure and maximum neighbourhood orderings

Discrete Applied Mathematics
Graph classes: a survey

Graph classes: a survey
Distance approximating trees for chordal and dually chordal graphs

Journal of Algorithms
Solving the all-pairs-shortest-length problem on chordal bipartite graphs

Information Processing Letters
Fast Estimation of Diameter and Shortest Paths (Without Matrix Multiplication)

SIAM Journal on Computing
Linear Time Algorithms for Dominating Pairs in Asteroidal Triple-free Graphs

SIAM Journal on Computing
Undirected single-source shortest paths with positive integer weights in linear time

Journal of the ACM (JACM)
Floats, integers, and single source shortest paths

Journal of Algorithms
A note on distance approximating trees in graphs

European Journal of Combinatorics
Distributed computing: a locality-sensitive approach

Distributed computing: a locality-sensitive approach
Approximate distance oracles

STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Computing shortest paths with comparisons and additions

SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Efficient Algorithms for All-Pairs Shortest Path Problem on Interval, Directed Path, and Circular-Arc Graphs

ICCI '93 Proceedings of the Fifth International Conference on Computing and Information
A Faster All-Pairs Shortest Path Algorithm for Real-Weighted Sparse Graphs

ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
On the Comparison-Addition Complexity of All-Pairs Shortest Paths

ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
Optimal (Parallel) Algorithms for the All-to-All Vertices Distance Problem for Certain Graph Classes

WG '92 Proceedings of the 18th International Workshop on Graph-Theoretic Concepts in Computer Science
LexBFS-Orderings and Power of Graphs

WG '96 Proceedings of the 22nd International Workshop on Graph-Theoretic Concepts in Computer Science
An Optimal Algorithm for Shortest Paths on Weighted Interval and Circular-Arc Graphs, with Applications

ESA '93 Proceedings of the First Annual European Symposium on Algorithms
Integer priority queues with decrease key in constant time and the single source shortest paths problem

Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
All pairs almost shortest paths

FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Compact Oracles for Reachability and Approximate Distances in Planar Digraphs

FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
On Diameter Verification and Boolean Matrix Multiplication.

On Diameter Verification and Boolean Matrix Multiplication.
Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)

Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)
A new approach to all-pairs shortest paths on real-weighted graphs

Theoretical Computer Science - Special issue on automata, languages and programming

Note: An improved algorithm for the longest induced path problem on k-chordal graphs

Discrete Applied Mathematics
Fast computation of empirically tight bounds for the diameter of massive graphs

Journal of Experimental Algorithmics (JEA)

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we show that a very simple and efficient approach can be used to solve the all pairs almost shortest path problem on the class of weakly chordal graphs and its different subclasses. Moreover, this approach works well also on graphs with small size of largest induced cycle and gives a unified way to solve the all pairs almost shortest path and all pairs shortest path problems on different graph classes including chordal, strongly chordal, chordal bipartite, and distance-hereditary graphs.