Bipartite Graph Matchings in the Semi-streaming Model
Authors:
- 1 January 2009
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 492-503
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Data Streams: Algorithms and ApplicationsFoundations and Trends® in Theoretical Computer Science, 2005
- Finding Graph Matchings in Data Streams2005
- Maximum Matchings via Gaussian Elimination2004
- On Graph Problems in a Semi-streaming ModelLecture Notes in Computer Science, 2004
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite GraphsSIAM Journal on Computing, 1973
- TWO THEOREMS IN GRAPH THEORYProceedings of the National Academy of Sciences, 1957