Bipartite Graph Matchings in the Semi-streaming Model
From MaRDI portal
Publication:3639269
DOI10.1007/978-3-642-04128-0_44zbMath1256.68130MaRDI QIDQ3639269
Anand Srivastav, Lasse Kliemann, Sebastian Eggert
Publication date: 29 October 2009
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-04128-0_44
68R10: Graph theory (including graph drawing) in computer science
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
05C85: Graph algorithms (graph-theoretic aspects)
68W25: Approximation algorithms
Related Items
Unnamed Item, Bipartite matching in the semi-streaming model, Linear Programming in the Semi-streaming Model with Application to the Maximum Matching Problem