Computing unique maximum matchings in O(m) time for König–Egerváry graphs and unicyclic graphs

Keyphrases

• Maximum Matching 100%
• Unicyclic Graph 100%
• Unique Perfect Matching 66%
• Perfect Matching 66%
• Unicyclic 66%
• Cardinality 33%
• Maximum Size 33%
• Empty Graph 33%
• Computer Science 33%
• Foundations of Computer Science 33%
• Slovakia 33%
• Leaf Removal 33%
• Independent Sets of Vertices 33%
• Non-bipartite Graph 33%

Mathematics

• Unicyclic 100%
• Perfect Matchings 100%
• Edge 25%
• Bipartite Graph 25%
• Cardinality 25%
• Mathematics 25%
• Independent Set 25%