A simple a. s. correct algorithm for deciding if a graph has a perfect matching

DOI10.1016/0166-218X(95)00052-SzbMath0834.05050OpenAlexW2166299685WikidataQ126857368 ScholiaQ126857368MaRDI QIDQ1902903

María Rosa Brito

Publication date: 18 January 1996

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0166-218x(95)00052-s

zbMATH Keywords

randomized algorithmsperfect matching

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• On the Geometry of Numbers in Elementary Number Theory
• Unnamed Item
• Unnamed Item

This page was built for publication: A simple a. s. correct algorithm for deciding if a graph has a perfect matching