Bestimmung eines maximalen Matching in beliebigen Graphen

DOI10.1007/BF02246734zbMath0247.05153OpenAlexW134236026MaRDI QIDQ2555874

Willibald Dörfler, J. R. Mühlbacher

Publication date: 1972

Published in: Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02246734

Mathematics Subject Classification ID

Graph theory (05C99) Software, source code, etc. for problems pertaining to combinatorics (05-04)

Related Items

F-factors of graphs: A generalized matching problem

Cites Work

• A Simple Algorithm for Finding Maximal Network Flows and an Application to the Hitchcock Problem
• Paths, Trees, and Flowers
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item