scientific article; zbMATH DE number 19225
From MaRDI portal
Publication:3976656
zbMATH Open0753.68081MaRDI QIDQ3976656FDOQ3976656
Authors: Zhuguo Mo, Kenneth L. Williams 
Publication date: 26 June 1992
Title of this publication is not available (Why is that?)
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
Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cited In (12)
- Title not available (Why is that?)
- Matchability and \(k\)-maximal matchings
- Tutte sets in graphs. II: The complexity of finding maximum Tutte sets
- Discontinuities in the complexities of some graph recognition problems
- Title not available (Why is that?)
- Disconnected matchings
- Disconnected matchings
- Complexity of a disjoint matching problem on bipartite graphs
- Title not available (Why is that?)
- Recovery of disrupted airline operations using \(k\)-maximum matching in graphs
- On complexity of special maximum matchings constructing
- Parameterized and Approximation Algorithms for Finding Two Disjoint Matchings
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)
