On Diameter Verification and Boolean Matrix Multiplication.

Authors:
Julien Basch;Sanjeev Khanna;Rajeev Motwani
Affiliations:
-;-;-
Venue:
On Diameter Verification and Boolean Matrix Multiplication.
Year:
1995

Citing 0
Cited 10

Fast estimation of diameter and shortest paths (without matrix multiplication)

Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Fast Boolean Matrix Multiplication for Highly Clustered Data

WADS '01 Proceedings of the 7th International Workshop on Algorithms and Data Structures
Almost Optimal (on the average) Combinatorial Algorithms for Boolean Matrix Product Witnesses, Computing the Diameter (Extended Abstract)

RANDOM '98 Proceedings of the Second International Workshop on Randomization and Approximation Techniques in Computer Science
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
A Geometric Approach to Boolean Matrix Multiplication

ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
Estimating all pairs shortest paths in restricted graph families: a unified approach

Journal of Algorithms
Matrix-vector multiplication in sub-quadratic time: (some preprocessing required)

SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Efficient algorithms for clique problems

Information Processing Letters
The Closest Pair Problem under the Hamming Metric

COCOON '09 Proceedings of the 15th Annual International Conference on Computing and Combinatorics
Estimating all pairs shortest paths in restricted graph families: a unified approach

Journal of Algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a practical algorithm that verifies whether a graph has diameter 2 in time O(n^{3} / log^{2} n}). A slight adaptation of this algorithm yields a boolean matrix multiplication algorithm which runs in the same time bound; thereby allowing us to compute transitive closure and verification of the diameter of a graph for any constant $d$ in O(n^{3} / log^{2} n}) time.