Witnesses for Boolean Matrix Multiplication and for Shortest Paths

15 years 6 months ago

Download www.math.tau.ac.il

Abstract Summary of results The subcubic (O(n ) for < 3) algorithms to multiply Boolean matrices do not provide the witnesses; namely, they compute C = AB but if Cij = 1 they do not find an index k (a witness)

Noga Alon, Zvi Galil, Oded Margalit, Moni Naor

Real-time Traffic

A Witness | Abstract Summary | Boolean Matrices | FOCS 1992 | Theoretical Computer Science |

claim paper

» Replacement Paths via Fast Matrix Multiplication

» Faster Approximation of Distances in Graphs

» Fast Estimation of Diameter and Shortest Paths without Matrix Multiplication

» More Algorithms for AllPairs Shortest Paths in Weighted Graphs

» On the Exponent of the All Pairs Shortest Path Problem

» Solving path problems on the GPU

» Faster algorithms for finding lowest common ancestors in directed acyclic graphs

» A Queueing Model Framework of PCEBased InterArea Path Computation

Post Info
More Details (n/a)

Added	10 Aug 2010
Updated	10 Aug 2010
Type	Conference
Year	1992
Where	FOCS
Authors	Noga Alon, Zvi Galil, Oded Margalit, Moni Naor

Comments (0)

Sciweavers

Witnesses for Boolean Matrix Multiplication and for Shortest Paths

A Witness | Abstract Summary | Boolean Matrices | FOCS 1992 | Theoretical Computer Science |

Explore & Download

Productivity Tools

Sciweavers