Unique maximum matching algorithms

DOI10.1145/301250.301273zbMath1345.05100OpenAlexW2058336700MaRDI QIDQ2819535

Harold N. Gabow, Haim Kaplan, Robert Endre Tarjan

Publication date: 29 September 2016

Published in: Proceedings of the thirty-first annual ACM symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/301250.301273

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Signed and weighted graphs (05C22)

Related Items (1)

Graph factors and factorization: 1985--2003: a survey

This page was built for publication: Unique maximum matching algorithms