Parameterized and approximation algorithms for finding two disjoint matchings
DOI10.1016/J.TCS.2014.03.030zbMATH Open1338.68095OpenAlexW1969297684MaRDI QIDQ300238FDOQ300238
Ying Fan, Lusheng Wang, Zhi-Zhong Chen
Publication date: 27 June 2016
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2014.03.030
Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Randomized algorithms (68W20) Approximation algorithms (68W25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Better approximations for max TSP
- An improved randomized approximation algorithm for Max TSP
- Color-coding
- On Linear Time Minor Tests with Depth-First Search
- Randomized Divide-and-Conquer: Improved Path, Matching, and Packing Algorithms
- Approximating the maximum 3-edge-colorable subgraph problem
- Packing \([1, \Delta ]\)-factors in graphs of small degree
- Approximating Maximum Edge 2-Coloring in Simple Graphs Via Local Improvement
- Approximating Maximum Edge 2-Coloring in Simple Graphs
- An Improved Approximation Algorithm for Maximum Edge 2-Coloring in Simple Graphs
- Approximating the maximum 2- and 3-edge-colorable subgraph problems
Cited In (8)
- Title not available (Why is that?)
- Sublinear Algorithms for Parameterized Matching
- Title not available (Why is that?)
- Parameterized algorithms and kernels for almost induced matching
- An efficient algorithm for finding a two-pair, and its applications
- Disjoint stable matchings in linear time
- Parameterized and approximation complexity of the detection pair problem in graphs
- Parameterized and Approximation Algorithms for Finding Two Disjoint Matchings
This page was built for publication: Parameterized and approximation algorithms for finding two disjoint matchings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q300238)
