Maximum weight induced matching in some subclasses of bipartite graphs
From MaRDI portal
Publication:2023124
DOI10.1007/s10878-020-00611-2zbMath1466.90091OpenAlexW3037755027MaRDI QIDQ2023124
Arti Pandey, Juhi Chaudhary, Manav Kashyap, B. S. Panda, Piyush Dane
Publication date: 3 May 2021
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-020-00611-2
Related Items (5)
Solving problems on generalized convex graphs via mim-width ⋮ Treewidth versus clique number. II: Tree-independence number ⋮ Weighted connected matchings ⋮ Solving problems on generalized convex graphs via mim-width ⋮ Linear-time algorithms for maximum-weight induced matchings and minimum chain covers in convex bipartite graphs
Cites Work
- Unnamed Item
- Circular convex bipartite graphs: feedback vertex sets
- Complexity of domination, Hamiltonicity and treewidth for tree convex bipartite graphs
- Feedback vertex sets on restricted bipartite graphs
- NP-completeness of some generalizations of the maximum matching problem
- Induced matchings
- Circular convex bipartite graphs: Maximum matching and Hamiltonian circuits
- Domination in some subclasses of bipartite graphs
- 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
- Finding a maximum induced matching in weakly chordal graphs
- On maximum induced matchings in bipartite graphs
- New results on induced matchings
- Tractable connected domination for restricted bipartite graphs
- Independent Domination on Tree Convex Bipartite Graphs
- Induced Matching in Some Subclasses of Bipartite Graphs
- Tree Convex Bipartite Graphs: $\mathcal{NP}$ -Complete Domination, Hamiltonicity and Treewidth
- Perfect Elimination and Chordal Bipartite Graphs
- A REVIEW OF TREE CONVEX SETS TEST
- Restricted Bipartite Graphs: Comparison and Hardness Results
This page was built for publication: Maximum weight induced matching in some subclasses of bipartite graphs
