Minimum maximal acyclic matching in proper interval graphs
From MaRDI portal
Publication:6132553
DOI10.1007/978-3-031-25211-2_29OpenAlexW4318023078MaRDI QIDQ6132553FDOQ6132553
Authors: Juhi Chaudhary, Sounaka Mishra, B. S. Panda 
Publication date: 17 August 2023
Published in: Algorithms and Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-031-25211-2_29
Cites Work
- A Linear Algorithm for Computing of a Minimum Weight Maximal Induced Matching in an Edge-Weighted Tree
- Edge Dominating Sets in Graphs
- Approximability results for the maximum and minimum maximal induced matching problems
- Generalized subgraph-restricted matchings in graphs
- A linear time recognition algorithm for proper interval graphs
- Parameterized algorithms for double hypergraph dualization with rank limitation and maximum minimal vertex cover
- Title not available (Why is that?)
- On the max min vertex cover problem
- The many facets of upper domination
- Acyclic Matching in Some Subclasses of Graphs
- On the complexity of minimum cardinality maximal uniquely restricted matching in graphs
- (In)approximability of maximum minimal FVS
- On the complexity of minimum maximal uniquely restricted matching
- On the complexity of minimum maximal acyclic matchings
Cited In (2)
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 Q6132553)
