Minimum maximal acyclic matching in proper interval graphs
From MaRDI portal
Publication:6648282
DOI10.1016/J.DAM.2024.10.012MaRDI QIDQ6648282
Juhi Chaudhary, B. S. Panda, Sounaka Mishra
Publication date: 4 December 2024
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
matchingproper interval graphsdually chordal graphslinear-time algorithmacyclic matchingminimum maximal acyclic matching
Could not fetch data.
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the max min vertex cover problem
- Approximability results for the maximum and minimum maximal induced matching problems
- A linear time recognition algorithm for proper interval graphs
- An effective dynamic programming algorithm for the minimum-cost maximal knapsack packing problem
- On the complexity of minimum cardinality maximal uniquely restricted matching in graphs
- The many facets of upper domination
- Generalized subgraph-restricted matchings in graphs
- Approximating maximum acyclic matchings by greedy and local search strategies
- Acyclic matching in some subclasses of graphs
- A Linear Algorithm for Computing of a Minimum Weight Maximal Induced Matching in an Edge-Weighted Tree
- Edge Dominating Sets in Graphs
- Dually Chordal Graphs
- On the complexity of minimum maximal uniquely restricted matching
- On the parameterized complexity of the acyclic matching problem
- In)approximability of Maximum Minimal FVS
- Minimum maximal acyclic matching in proper interval graphs
- Parameterized Results on Acyclic Matchings with Implications for Related Problems
- $\mathcal{P}$-matchings Parameterized by Treewidth
- On the complexity of minimum maximal acyclic matchings
This page was built for publication: Minimum maximal acyclic matching in proper interval graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6648282)
