Matching in Bipartite Graph Streams in a Small Number of Passes (Extended Abstract)

Research Area: Engineering of Approximation Algorithms for Matching and Covering in Hypergraphs and Large Graphs Year: 2011
Type of Publication: In Proceedings
Authors: Lasse Kliemann
Book title: Proceedings of the 10th International Symposium on Experimental and Efficient Algorithms, Kolimpari, Chania, Crete, Greece, May 2011 (SEA 2011)
Pages: 254-266
Document ID: dda51148-ac5b-4655-9c4f-e01f26511235
[ Back ]