scientific article; zbMATH DE number 19225

MaRDI QIDQ3976656zbMATH OpenFDO

Authors Zhuguo Mo, Kenneth L. Williams

Publication date 26 June 1992

zbMATH Keywords

maximum matching

Mathematics Subject Classification ID

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

Recommendations

• Matchability and \(k\)-maximal matchings
• Complexity of a disjoint matching problem on bipartite graphs
• On complexity of special maximum matchings constructing
• Parameterized and approximation algorithms for finding two disjoint matchings
• Parameterized and Approximation Algorithms for Finding Two Disjoint Matchings
• On k-match problems
• On minimum maximal distance-\(k\) matchings
• On minimum maximal distance-\(k\) matchings
• scientific article; zbMATH DE number 1303560

Cited in

(13)

• Maximum bounded \(H\)-matching is Max SNP-complete
• Tutte sets in graphs. II: The complexity of finding maximum Tutte sets
• Recovery of disrupted airline operations using \(k\)-maximum matching in graphs
• Complexity of a disjoint matching problem on bipartite graphs
• Discontinuities in the complexities of some graph recognition problems
• Parameterized and Approximation Algorithms for Finding Two Disjoint Matchings
• scientific article; zbMATH DE number 1003276 (Why is no real title available?)
• scientific article; zbMATH DE number 4025482 (Why is no real title available?)
• scientific article; zbMATH DE number 2040948 (Why is no real title available?)
• Disconnected matchings
• Disconnected matchings
• Matchability and \(k\)-maximal matchings
• On complexity of special maximum matchings constructing

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3976656)