Maximum matching in regular and almost regular graphs
type: Item
instance of: scholarly article
title: Maximum matching in regular and almost regular graphs
zbMATH Open document ID: 1263.05081
author: Raphael Yuster
published in: Algorithmica
publication date: 2013-05-16T00:00:00Z
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 05C35
zbMATH DE Number: 6163656
zbMATH Keywords: maximum matching
zbMATH Keywords: regular graph
zbMATH Keywords: algorithm
MaRDI profile type: Publication
full work available at URL: s00453-012-9625-7
OpenAlex ID: W2108763491
cites work: Q4252281
cites work: Q4038720
cites work: Q4830805
cites work: Edge-coloring bipartite multigraphs in \(O(E \log D)\) time
cites work: Paths, Trees, and Flowers
cites work: Algorithms for Edge Coloring Bipartite Graphs and Multigraphs
cites work: Faster scaling algorithms for general graph matching problems
cites work: Perfect matchings in \(O(n \log n)\) time in regular bipartite graphs
cites work: Perfect matchings via uniform sampling in regular bipartite graphs
cites work: An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
cites work: A theory of alternating paths and blossoms for proving correctness of the \(O(\sqrt{V}E)\) general graph maximum matching algorithm
DOI: 10.1007/S00453-012-9625-7
description: scientific article; zbMATH DE number 6163656