Further Algebraic Algorithms in the Congested Clique Model and Applications to Graph-Theoretic Problems
- 4 September 2016
- book chapter
- Published by Springer Nature
- p. 57-70
Abstract
No abstract availableKeywords
All Related Versions
This publication has 29 references indexed in Scilit:
- Near-Constant-Time Distributed Algorithms on a Congested CliqueLecture Notes in Computer Science, 2014
- Lessons from the Congested Clique Applied to MapReduceLecture Notes in Computer Science, 2014
- “Tri, Tri Again”: Finding Triangles and Small Subgraphs in a Distributed Setting2012
- All pairs shortest paths using bridging sets and rectangular matrix multiplicationJournal of the ACM, 2002
- Randomized $\tilde{O}(M(|V|))$ Algorithms for Problems in Matching TheorySIAM Journal on Computing, 1997
- On the All-Pairs-Shortest-Path Problem in Unweighted Undirected GraphsJournal of Computer and System Sciences, 1995
- Communication complexity of matrix computation over finite fieldsTheory of Computing Systems, 1995
- On wiedemann's method of solving sparse linear systems1991
- Maximum matchings in general graphs through randomizationJournal of Algorithms, 1989
- An improved parallel processor bound in fast matrix inversionInformation Processing Letters, 1978