Bipartite Graph Matchings in the Semi-streaming Model

DOI10.1007/978-3-642-04128-0_44zbMath1256.68130OpenAlexW1564876084MaRDI 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

zbMATH Keywords

approximation algorithmsstreaming algorithmsbipartite graph matching

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)

Related Items (3)

Bipartite matching in the semi-streaming model ⋮ Linear Programming in the Semi-streaming Model with Application to the Maximum Matching Problem ⋮ Unnamed Item

This page was built for publication: Bipartite Graph Matchings in the Semi-streaming Model