Maximum weight induced matching in some subclasses of bipartite graphs
From MaRDI portal
(Redirected from Publication:2023124)
Recommendations
Cites work
- scientific article; zbMATH DE number 1420901 (Why is no real title available?)
- A review of tree convex sets test
- Circular convex bipartite graphs: Maximum matching and Hamiltonian circuits
- Circular convex bipartite graphs: feedback vertex sets
- Complexity of domination, Hamiltonicity and treewidth for tree convex bipartite graphs
- Domination in some subclasses of bipartite graphs
- Feedback vertex sets on restricted bipartite graphs
- Finding a maximum induced matching in weakly chordal 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
- Independent domination on tree convex bipartite graphs
- Induced Matching in Some Subclasses of Bipartite Graphs
- Induced matchings
- NP-completeness of some generalizations of the maximum matching problem
- New results on induced matchings
- On maximum induced matchings in bipartite graphs
- On the approximability of the maximum induced matching problem
- Perfect Elimination and Chordal Bipartite Graphs
- Restricted Bipartite Graphs: Comparison and Hardness Results
- Tractable connected domination for restricted bipartite graphs
- Tree Convex Bipartite Graphs: $\mathcal{NP}$ -Complete Domination, Hamiltonicity and Treewidth
Cited in
(15)- Linear-time algorithms for maximum-weight induced matchings and minimum chain covers in convex bipartite graphs
- An Optimum Lower Bound for the Weights of Maximum Weight Matching in Bipartite Graphs
- Dominating induced matching in some subclasses of bipartite graphs
- Maximum weight edge-constrained matchings
- Parameterized results on acyclic matchings with implications for related problems
- Solving problems on generalized convex graphs via mim-width
- Treewidth versus clique number. II: Tree-independence number
- On maximum induced matchings in bipartite graphs
- Weighted connected matchings
- Solving problems on generalized convex graphs via mim-width
- Induced matchings in strongly biconvex graphs and some algebraic applications
- The induced matching and chain subgraph cover problems for convex bipartite graphs
- Generalizing the induced matching by edge capacity constraints
- Optimum matchings in weighted bipartite graphs
- A decomposition theorem for maximum weight bipartite matchings
This page was built for publication: Maximum weight induced matching in some subclasses of bipartite graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2023124)
