scientific article; zbMATH DE number 434499
From MaRDI portal
Publication:3139292
Recommendations
- Maximum matchings in bipartite graphs via strong spanning trees
- The number of maximum matchings in a tree
- On the strong chromatic index and maximum induced matching of tree-cographs, permutation graphs and chordal bipartite graphs
- scientific article; zbMATH DE number 1496857
- A Competitive Strong Spanning Tree Algorithm for the Maximum Bipartite Matching Problem
Cited in
(37)- Integer Programming Formulations and Benders Decomposition for the Maximum Induced Matching Problem
- Algorithms for finding an independent \(\{K_1,K_2\}\)-packing of maximum weight in a graph
- Solving the problem of finding an independent \(\{K_1,K_2\}\)-packing of maximum weight on graphs of bounded treewidth
- Solving the problem of finding an independent \(\{K_1,K_2\}\)-packing of maximum weight on graphs with special blocks
- Induced matching vs edge open packing: trees and product graphs
- Independent packings in structured graphs
- Approximating weighted induced matchings
- Strong WQO Tree Theorems
- Generalized subgraph-restricted matchings in graphs
- Maximum induced matching of hexagonal graphs
- Maximum induced matching problem on hhd-free graphs
- Some results on graphs without long induced paths
- Linear time algorithms for generalized edge dominating set problems
- A polynomial time algorithm for strong edge coloring of partial \(k\)-trees
- A min-max property of chordal bipartite graphs with applications
- A linear algorithm for computing of a minimum weight maximal induced matching in an edge-weighted tree
- On maximum induced matchings in bipartite graphs
- Induced matchings in asteroidal triple-free graphs
- Brambles and independent packings in chordal graphs
- The parameterized complexity of the induced matching problem
- Moderately exponential time algorithms for the maximum induced matching problem
- On distance-3 matchings and induced matchings
- New kernels for several problems on planar graphs
- Squares of Intersection Graphs and Induced Matchings
- Neighborhood covering and independence on P₄-tidy graphs and tree-cographs
- On distance-3 matchings and induced matchings
- On the strong chromatic index and maximum induced matching of tree-cographs, permutation graphs and chordal bipartite graphs
- A Linear Algorithm for Computing of a Minimum Weight Maximal Induced Matching in an Edge-Weighted Tree
- Well-indumatched pseudoforests
- Approximability results for the maximum and minimum maximal induced matching problems
- The induced matching and chain subgraph cover problems for convex bipartite graphs
- Maximum induced matchings for chordal graphs in linear time
- On the approximability of the maximum induced matching problem
- Maximal and maximum induced matchings in connected graphs
- New results on induced matchings
- Well-indumatched Trees and Graphs of Bounded Girth
- Finding a maximum induced matching in weakly chordal graphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3139292)
