@inproceedings{8c4362c472aa4f9eba8e38cffb81af05,
title = "Minimum Maximal Acyclic Matching in Proper Interval Graphs",
abstract = "Given a graph G, Min-Max-Acy-Matching is the problem of finding a maximal matching M in G of minimum cardinality such that the set of M-saturated vertices induces an acyclic subgraph in G. The decision version of Min-Max-Acy-Matching is known to be NP -complete even for planar perfect elimination bipartite graphs. In this paper, we give the first positive algorithmic result for Min-Max-Acy-Matching by presenting a linear-time algorithm for computing a minimum cardinality maximal acyclic matching in proper interval graphs.",
keywords = "Acyclic matching, Linear-time algorithm, Matching, Minimum maximal acyclic matching",
author = "Juhi Chaudhary and Sounaka Mishra and Panda, {B. S.}",
note = "Publisher Copyright: {\textcopyright} 2023, The Author(s), under exclusive license to Springer Nature Switzerland AG.; 9th International Conference on Algorithms and Discrete Applied Mathematics, CALDAM 2023 ; Conference date: 09-02-2023 Through 11-02-2023",
year = "2023",
month = jan,
day = "1",
doi = "10.1007/978-3-031-25211-2_29",
language = "English",
isbn = "9783031252105",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Science and Business Media Deutschland GmbH",
pages = "377--388",
editor = "Amitabha Bagchi and Rahul Muthu",
booktitle = "Algorithms and Discrete Applied Mathematics - 9th International Conference, CALDAM 2023, Proceedings",
address = "Germany",
}