Finding a maximum induced matching in weakly chordal graphs
From MaRDI portal
Publication:1810638
Recommendations
- On maximum induced matchings in bipartite graphs
- Induced matchings
- 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
- New results on induced matchings
- Induced Matching in Some Subclasses of Bipartite Graphs
Cites work
- scientific article; zbMATH DE number 434499 (Why is no real title available?)
- scientific article; zbMATH DE number 1445284 (Why is no real title available?)
- Algorithms for weakly triangulated graphs
- Comparability graphs and intersection graphs
- Covering and coloring polygon-circle graphs
- Graph Classes: A Survey
- Induced matchings
- Induced matchings in asteroidal triple-free graphs
- Induced matchings in intersection graphs
- Irredundancy in circular arc graphs
- Maximum weight independent sets and cliques in intersection graphs of filaments
- NP-completeness of some generalizations of the maximum matching problem
- New results on induced matchings
- Optimizing weakly triangulated graphs
- Thresholds for classes of intersection graphs
- Weakly triangulated graphs
Cited in
(53)- Efficient Algorithms for Maximum Induced Matching Problem in Permutation and Trapezoid Graphs
- The algebraic connectivity of graphs with given induced matching number
- Approximation of knapsack problems with conflict and forcing graphs
- The graphs with maximum induced matching and maximum matching the same size
- 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
- \(\mathcal{P}\)-matchings parameterized by treewidth
- Induced Matching in Some Subclasses of Bipartite Graphs
- Some bounds on the maximum induced matching numbers of certain grids
- Independent packings in structured graphs
- Approximating weighted induced matchings
- The complexity of dissociation set problems in graphs
- The induced separation dimension of a graph
- Maximum induced matching problem on hhd-free graphs
- Induced matchings in graphs of degree at most 4
- Clique separator decomposition of hole-free and diamond-free graphs and algorithmic consequences
- New min-max theorems for weakly chordal and dually chordal graphs
- A min-max property of chordal bipartite graphs with applications
- Maximum weight induced matching in some subclasses of bipartite graphs
- On the parameterized complexity of the acyclic matching problem
- Graphs with maximal induced matchings of the same size
- Maximum Induced Matchings in Grids
- On the complexity of the dominating induced matching problem in hereditary classes of graphs
- Complexity of deciding the equality of matching numbers
- Brambles and independent packings in chordal graphs
- The parameterized complexity of the induced matching problem
- Induced matchings in strongly biconvex graphs and some algebraic applications
- 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
- Edge open packing: complexity, algorithmic aspects, and bounds
- Maximum induced matching algorithms via vertex ordering characterizations
- On distance-3 matchings and induced matchings
- Maximum induced matching algorithms via vertex ordering characterizations
- Linear-time algorithms for maximum-weight induced matchings and minimum chain covers in convex bipartite graphs
- On the strong chromatic index and maximum induced matching of tree-cographs, permutation graphs and chordal bipartite graphs
- Equality of distance packing numbers
- 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
- 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
- Large Induced Subgraphs via Triangulations and CMSO
- Recent progress on strong edge-coloring of graphs
- The \(\text{v} \)-number of monomial ideals
- A constant factor approximation algorithm for boxicity of circular arc graphs
- On the approximability of the maximum induced matching problem
- Perfectly matched sets in graphs: parameterized and exact computation
- On the induced matching problem in Hamiltonian bipartite graphs
- Contractions in perfect graphs
- Finding dominating induced matchings in \(P_8\)-free graphs in polynomial time
This page was built for publication: Finding a maximum induced matching in weakly chordal graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1810638)
