Minimum maximal acyclic matching in proper interval graphs

DOI10.1007/978-3-031-25211-2_29MaRDI QIDQ6132553zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

matchinglinear-time algorithmacyclic matchingminimum maximal acyclic matching

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites work

• scientific article; zbMATH DE number 4152428 (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 linear time recognition algorithm for proper interval graphs
• 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
• On the complexity of minimum cardinality maximal uniquely restricted matching in graphs
• On the complexity of minimum maximal acyclic matchings
• On the complexity of minimum maximal uniquely restricted matching
• On the max min vertex cover problem
• Parameterized algorithms for double hypergraph dualization with rank limitation and maximum minimal vertex cover
• The many facets of upper domination

Cited in

(2)

• On the complexity of minimum maximal acyclic matchings
• Minimum maximal acyclic matching in proper interval graphs

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)