On minimum maximal distance-k matchings
DOI10.1016/J.ENDM.2016.11.011zbMATH Open1355.68123OpenAlexW2915515624MaRDI QIDQ509288FDOQ509288
Authors: Yury Kartynnik, Andrew Ryzhikov 
Publication date: 9 February 2017
Full work available at URL: https://doi.org/10.1016/j.endm.2016.11.011
Recommendations
Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Computational Complexity
- Analytical approach to parallel repetition
- NP-completeness of some generalizations of the maximum matching problem
- Title not available (Why is that?)
- Approximability results for the maximum and minimum maximal induced matching problems
- Computing independent sets in graphs with large girth
- On the maximum independent set problem in subclasses of planar graphs
- Title not available (Why is that?)
Cited In (10)
- Matchability and \(k\)-maximal matchings
- On two extensions of equimatchable graphs
- Title not available (Why is that?)
- New min-max theorems for weakly chordal and dually chordal graphs
- On minimum maximal distance-\(k\) matchings
- On distance-3 matchings and induced matchings
- On distance-3 matchings and induced matchings
- Equality of distance packing numbers
- Minimum Partial-Matching and Hausdorff RMS-Distance under Translation: Combinatorics and Algorithms
- Title not available (Why is that?)
This page was built for publication: On minimum maximal distance-\(k\) matchings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q509288)
