scientific article; zbMATH DE number 1420901
From MaRDI portal
Publication:4944970
Recommendations
Cited in
(51)- Efficient edge domination in regular graphs
- The parameterized complexity of the induced matching problem
- Analysis of greedy algorithms on graphs with bounded degrees
- Induced matchings in intersection graphs.
- Maximum induced matchings of random cubic graphs
- Locally searching for large induced matchings
- Approximating weighted induced matchings
- On the approximability of the maximum induced matching problem
- Generalized subgraph-restricted matchings in graphs
- The k-regular induced subgraph problem
- New results on maximum induced matchings in bipartite graphs and beyond
- Approximating maximum acyclic matchings by greedy and local search strategies
- Maximum weight induced matching in some subclasses of bipartite graphs
- On the induced matching problem in Hamiltonian bipartite graphs
- The \(\text{v} \)-number of monomial ideals
- Linear programming based approximation for unweighted induced matchings -- breaking the \(\varDelta\) barrier
- Moderately exponential time algorithms for the maximum induced matching problem
- Dominating and large induced trees in regular graphs
- Generalizing the induced matching by edge capacity constraints
- Perfectly matched sets in graphs: parameterized and exact computation
- Induced matchings in graphs of bounded maximum degree
- Induced Matching in Some Subclasses of Bipartite Graphs
- scientific article; zbMATH DE number 5952201 (Why is no real title available?)
- On graphs with induced matching number almost equal to matching number
- A parallel hybrid greedy branch and bound scheme for the maximum distance-2 matching problem
- A Linear Algorithm for Computing of a Minimum Weight Maximal Induced Matching in an Edge-Weighted Tree
- Maximum matching in multi-interface networks
- Two greedy consequences for maximum induced matchings
- Recent progress on strong edge-coloring of graphs
- Some bounds on the maximum induced matching numbers of certain grids
- Combinatorial Geometry and Graph Theory
- Induced matchings in graphs of degree at most 4
- A linear algorithm for computing of a minimum weight maximal induced matching in an edge-weighted tree
- Approximation and Online Algorithms
- Parameterized complexity of perfectly matched sets
- On the parameterized complexity of the acyclic matching problem
- On the induced matching problem
- Edge open packing: complexity, algorithmic aspects, and bounds
- Parameterized results on acyclic matchings with implications for related problems
- Complexity of deciding the equality of matching numbers
- Maximum regular induced subgraphs in 2P₃-free graphs
- \(\mathcal{P}\)-matchings parameterized by treewidth
- Parameterized complexity of perfectly matched sets
- Induced matching vs edge open packing: trees and product graphs
- Maximum induced matching of hexagonal graphs
- Structural parameterizations for induced and acyclic matching
- Disjoint dominating and 2-dominating sets in graphs: hardness and approximation results
- Induced matchings in bipartite graphs
- A \((2-c\frac{1}{\sqrt{N}})\)-approximation algorithm for the stable marriage problem
- Approximability results for the maximum and minimum maximal induced matching problems
- Approximation hardness of dominating set problems in bounded degree 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 Q4944970)
