Maximum weight induced matching in some subclasses of bipartite graphs
type: Item
instance of: scholarly article
title: Maximum weight induced matching in some subclasses of bipartite graphs
zbMATH Open document ID: 1466.90091
author: B. S. Panda
author: Arti Pandey
author: Juhi Chaudhary
author: Piyush Dane
author: Manav Kashyap
published in: Journal of Combinatorial Optimization
publication date: 2021-05-03T00:00:00Z
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 7341852
zbMATH Keywords: matching
zbMATH Keywords: induced matching
zbMATH Keywords: bipartite graphs
zbMATH Keywords: graph algorithm
zbMATH Keywords: NP-complete
MaRDI profile type: MaRDI publication profile
full work available at URL: s10878-020-00611-2
OpenAlex ID: W3037755027
cites work: A review of tree convex sets test
cites work: Induced matchings
cites work: Finding a maximum induced matching in weakly chordal graphs
cites work: Complexity of domination, Hamiltonicity and treewidth for tree convex bipartite graphs
cites work: On the approximability of the maximum induced matching problem
cites work: Perfect Elimination and Chordal Bipartite Graphs
cites work: New results on induced matchings
cites work: Feedback vertex sets on restricted bipartite graphs
cites work: 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
cites work: Circular convex bipartite graphs: Maximum matching and Hamiltonian circuits
cites work: Restricted Bipartite Graphs: Comparison and Hardness Results
cites work: Tractable connected domination for restricted bipartite graphs
cites work: Circular convex bipartite graphs: feedback vertex sets
cites work: On maximum induced matchings in bipartite graphs
cites work: Domination in some subclasses of bipartite graphs
cites work: Induced Matching in Some Subclasses of Bipartite Graphs
cites work: Independent domination on tree convex bipartite graphs
cites work: NP-completeness of some generalizations of the maximum matching problem
cites work: Tree Convex Bipartite Graphs: $\mathcal{NP}$ -Complete Domination, Hamiltonicity and Treewidth
cites work: Q4944970
DOI: 10.1007/S10878-020-00611-2
Recommended article: Induced Matching in Some Subclasses of Bipartite Graphs
Recommended article: On maximum induced matchings in bipartite graphs
Recommended article: Dominating induced matching in some subclasses of bipartite graphs
Recommended article: Induced matchings
description: scientific article; zbMATH DE number 7341852