Weighted Matching in the Semi-Streaming Model

DOI10.4230/LIPIcs.STACS.2008.1312zbMath1259.68240OpenAlexW2570637728MaRDI QIDQ4910759

Mariano Zelke

Publication date: 19 March 2013

Full work available at URL: http://subs.emis.de/LIPIcs/frontdoor_b10e.html

zbMATH Keywords

matchinggraph algorithmapproximation algorithmsemi-streaming algorithm

Mathematics Subject Classification ID

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

Related Items (6)

Optimal per-edge processing times in the semi-streaming model ⋮ Submodular maximization meets streaming: matchings, matroids, and more ⋮ Intractability of min- and max-cut in streaming graphs ⋮ Maximum Matching in Two, Three, and a Few More Passes Over Graph Streams ⋮ Dynamic Approximate Vertex Cover and Maximum Matching ⋮ Unnamed Item

This page was built for publication: Weighted Matching in the Semi-Streaming Model