2026-08-15T17:07:53Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:9938 2024-03-06T10:45:09Z ddc:004 open_access

Deterministic Algorithms for Maximum Matching on General Graphs in the Semi-Streaming Model Tirodkar, Sumedh Semi Streaming Maximum Matching We present an improved deterministic algorithm for Maximum Cardinality Matching on general graphs in the Semi-Streaming Model. In the Semi-Streaming Model, a graph is presented as a sequence of edges, and an algorithm must access the edges in the given sequence. It can only use O(n polylog n) space to perform computations, where n is the number of vertices of the graph. If the algorithm goes over the stream k times, it is called a k-pass algorithm. In this model, McGregor [McGregor, 2005] gave the currently best known randomized (1+epsilon)-approximation algorithm for maximum cardinality matching on general graphs, that uses (1/epsilon)^{O(1/epsilon)} passes. Ahn and Guha [Ahn and Guha, 2013] later gave the currently best known deterministic (1+epsilon)-approximation algorithms for maximum cardinality matching: one on bipartite graphs that uses O(log log(1/epsilon)/epsilon^2) passes, and the other on general graphs that uses O(log n *poly(1/epsilon)) passes (note that, for general graphs, the number of passes is dependent on the size of the input). We present the first deterministic algorithm that achieves a (1+epsilon)-approximation on general graphs in only a constant number ((1/epsilon)^{O(1/epsilon)}) of passes. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Sumedh Tirodkar 2018 Is Part Of LIPIcs, Volume 122, 38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2018) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.FSTTCS.2018.39 urn:nbn:de:0030-drops-99383 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2018.39 eng https://creativecommons.org/licenses/by/3.0/legalcode