Minimum maximal acyclic matching in proper interval graphs

DOI10.1007/978-3-031-25211-2_29OpenAlexW4318023078MaRDI QIDQ6132553

B. S. Panda, Sounaka Mishra, Juhi Chaudhary

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

zbMATH Keywords

matchinglinear-time algorithmacyclic matchingminimum maximal acyclic matching

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites Work

• Unnamed Item
• Parameterized algorithms for double hypergraph dualization with rank limitation and maximum minimal vertex cover
• 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
• On the complexity of minimum cardinality maximal uniquely restricted matching in graphs
• The many facets of upper domination
• Generalized subgraph-restricted matchings in graphs
• (In)approximability of maximum minimal FVS
• A Linear Algorithm for Computing of a Minimum Weight Maximal Induced Matching in an Edge-Weighted Tree
• Edge Dominating Sets in Graphs
• Acyclic Matching in Some Subclasses of Graphs
• On the complexity of minimum maximal uniquely restricted matching
• On the complexity of minimum maximal acyclic matchings

This page was built for publication: Minimum maximal acyclic matching in proper interval graphs