On the complexity of minimum maximal acyclic matchings
From MaRDI portal
Publication:6168934
Cites work
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1330033 (Why is no real title available?)
- (In)approximability of maximum minimal FVS
- A Linear Algorithm for Computing of a Minimum Weight Maximal Induced Matching in an Edge-Weighted Tree
- A simplified NP-complete satisfiability problem
- Acyclic Matching in Some Subclasses of Graphs
- Approximability results for the maximum and minimum maximal induced matching problems
- Edge Dominating Sets in Graphs
- Generalized subgraph-restricted matchings in graphs
- Independent domination in graphs: A survey and recent results
- Matching theory
- Node-Deletion NP-Complete Problems
- On the approximability of the maximum common subgraph problem
- On the complexity of minimum cardinality maximal uniquely restricted matching in graphs
- On the complexity of minimum maximal uniquely restricted matching
- On the max min vertex cover problem
- Optimization, approximation, and complexity classes
- Parameterized algorithms for double hypergraph dualization with rank limitation and maximum minimal vertex cover
- Paths, Trees, and Flowers
- Perfect Elimination and Chordal Bipartite Graphs
- The many facets of upper domination
- Uniquely restricted matchings in subcubic graphs
Cited in
(4)
This page was built for publication: On the complexity of minimum maximal acyclic matchings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6168934)
