Generalizing the induced matching by edge capacity constraints
From MaRDI portal
Publication:2467130
DOI10.1016/j.disopt.2006.11.004zbMath1163.90606OpenAlexW2015510928MaRDI QIDQ2467130
Hiroshi Nagamochi, Takuro Fukunaga
Publication date: 18 January 2008
Published in: Discrete Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disopt.2006.11.004
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Edge domination on bipartite permutation graphs and cotriangulated graphs
- Irredundancy in circular arc graphs
- Approximating the tree and tour covers of a graph
- A polynomial algorithm for b-matchings: An alternative approach
- NP-completeness of some generalizations of the maximum matching problem
- Induced matchings
- Clique is hard to approximate within \(n^{1-\epsilon}\)
- A 2-approximation algorithm for the minimum weight edge dominating set problem
- Finding maximum induced matchings in subclasses of claw-free and \(P_5\)-free graphs, and in graphs with matching and induced matching of equal maximum size
- On the approximability of the maximum induced matching problem
- On maximum induced matchings in bipartite graphs
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- A polynomial time algorithm for strong edge coloring of partial \(k\)-trees
- New results on induced matchings
- Approximability of the capacitated \(b\)-edge dominating set problem
- Minimum Edge Dominating Sets
- Edge Dominating Sets in Graphs
- Algorithms and Computation
- A \(2\frac{1}{10}\)-approximation algorithm for a generalization of the weighted edge-dominating set problem
This page was built for publication: Generalizing the induced matching by edge capacity constraints
