Parameterized complexity of perfectly matched sets
From MaRDI portal
Cites work
- Extremal combinatorics. With applications in computer science
- Graph theory
- scientific article; zbMATH DE number 1420901 (Why is no real title available?)
- scientific article; zbMATH DE number 2234775 (Why is no real title available?)
- Improved induced matchings in sparse graphs
- Induced matchings in intersection graphs.
- Interval deletion is fixed-parameter tractable
- Interval graph representation with given interval and intersection lengths
- Matching cut in graphs with large minimum degree
- Matching cutsets in graphs
- New results on maximum induced matchings in bipartite graphs and beyond
- NP-completeness of some generalizations of the maximum matching problem
- On the complexity of matching cut in graphs of fixed diameter
- On the induced matching problem
- On the np-completeness of certain network testing problems
- Parameterized algorithms
- Parametrized complexity theory.
- Random Separation: A New Method for Solving Fixed-Cardinality Optimization Problems
- Recognizing decomposable graphs
- Subexponential algorithms for partial cover problems
- The Bidimensional Theory of Bounded-Genus Graphs
- The complexity of the matching-cut problem for planar graphs and other graph classes
- The parameterized complexity of the induced matching problem
- The perfect matching cut problem revisited
This page was built for publication: Parameterized complexity of perfectly matched sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6969011)
