Abstract
We describe almost optimal (on the average) combinatorial algorithms for the following algorithmic problems: (i) computing the boolean matrix product, (ii) finding witnesses for boolean matrix multiplication and (iii) computing the diameter and all-pairs-shortest-paths of a given (unweighted) graph/digraph. For each of these problems, we assume that the input instances are drawn from suitable distributions. A random boolean matrix (graph/digraph) is one in which each entry (edge/arc) is set to 1 or 0 (included) independently with probability p. Even though fast algorithms have been proposed earlier, they are based on algebraic approaches which are complex and difficult to implement. Our algorithms are purely combinatorial in nature and are much simpler and easier to implement. They are based on a simple combinatorial approach to multiply boolean matrices. Using this approach, we design fast algorithms for (a) computing product and witnesses when A and B both are random boolean matrices or when A is random and B is arbitrary but fixed (or vice versa) and (b) computing diameter, distances and shortest paths between all pairs in the given random graph/digraph. Our algorithms run in O(n 2(log n)) time with O(n -3) failure probability thereby yielding algorithms with expected running times within the same bounds. Our algorithms work for all values of p.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
D. Aingworth, C. Chekuri, P. Indyk and R. Motwani, “Fast Estimation of Diameter and Shortest Paths (without Matrix Multiplication)”, Proceedings of the Seventh Annual ACM Symposium on Discrete Algorithms, pp. 547–554, 1996.
N. Alon, Z. Galil, O. Margalit and M. Naor, “Witnesses for Boolean Matrix Multiplication and Shortest Paths”, Proceedings of the 33rd IEEE Symposium on Foundations of Computer Science, pp.417–426, October 1992.
N. Alon and M. Naor, “Derandomization, Witnesses for Boolean Matrix Multiplication and Construction of Perfect hash functions”, Algorithmica, 16:434–449, 1996.
N. Alon and J. Spencer, The Probabilistic Method, John Wiley & Sons, 1992.
V.L. Arlazarov, E.A. Dinic, M.A. Kronrod and L.A. Faradzev, “On economical construction of the transitive closure of a directed graph”, Doklady Acad. Nauk SSSR, 194:487–488, 1970 (in Russian).
J. Basch, S. Khanna and R. Motwani, “On Diameter Verification and Boolean Matrix Multiplication”, Technical Report, Stanford University CS department, 1995.
B. Bollobas, Random Graphs, Academic Press (London), 1985.
F.R.K. Chung, “Diameters of Graphs: Old Problems and New Results”, Congressus Numerantium, 60:295–317, 1987.
D. Coppersmith and S. Winograd, “Matrix multiplication via arithmetic progressions”, Journal of Symbolic Computation, 9(3):251–280, 1990.
Z. Galil and O. Margalit, “Witnesses for Boolean Matrix Multiplication and Shortest Paths”, Journal of Complexity, pp. 417–426, 1993.
R. Hassin and E. Zemel, “On Shortest Paths in Graphs with Random Weights”, Mathematics of Operations Research, Vol.10, No.4, 1985, 557–564.
M. Karonski, “Random Graphs”, Chapter 6, Handbook of Combinatorics, Vol. I, ed. Graham, Grötschel, Lovászi, North-Holland, pp.351–380, 1995.
C.J.H. McDiarmid, “On the method of bounded differences”, Surveys in Combinatorics, Edited by J. Siemons, London Mathematical Society Lecture Notes Series 141, pp.148–188, 1989.
R. Motwani and P. Raghavan, Randomized Algorithms, Cambridge University Press, 1995.
C.P. Schnorr, “Computation of the Boolean Matrix-Vector AND/OR-Product in Average Time O(m + n(log n))”, Informatik-Festschrift zum 60. Geburtstag von Günter Hotz, (eds. Buchmann/ Ganzinger/ Paul), Teubner-Texte zur Informatik Band 1, 1992, pp.359–362.
R. Seidel, “On the All-Pairs-Shortest-Path Problem”, Proceedings of the 24th ACM Symposium on Theory of Computing, 745–749, 1992.
A. Srinivasan, “Scheduling and load-balancing via randomization”, Proceedings of the FST&TCS’97 Pre-conference Workshop on Randomized Algorithms, Kharagpur, India, December, 1997.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Schnorr, C.P., Subramanian, C.R. (1998). Almost Optimal (on the average) Combinatorial Algorithms for Boolean Matrix Product Witnesses, Computing the Diameter (Extended Abstract). In: Luby, M., Rolim, J.D.P., Serna, M. (eds) Randomization and Approximation Techniques in Computer Science. RANDOM 1998. Lecture Notes in Computer Science, vol 1518. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-49543-6_18
Download citation
DOI: https://doi.org/10.1007/3-540-49543-6_18
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65142-0
Online ISBN: 978-3-540-49543-7
eBook Packages: Springer Book Archive