Minimum Maximal Acyclic Matching in Proper Interval Graphs

Juhi Chaudhary, Sounaka Mishra, B. S. Panda

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

1 Scopus citations


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.

Original languageEnglish
Title of host publicationAlgorithms and Discrete Applied Mathematics - 9th International Conference, CALDAM 2023, Proceedings
EditorsAmitabha Bagchi, Rahul Muthu
PublisherSpringer Science and Business Media Deutschland GmbH
Number of pages12
ISBN (Print)9783031252105
StatePublished - 1 Jan 2023
Event9th International Conference on Algorithms and Discrete Applied Mathematics, CALDAM 2023 - Gandhinagar, India
Duration: 9 Feb 202311 Feb 2023

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume13947 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference9th International Conference on Algorithms and Discrete Applied Mathematics, CALDAM 2023


  • Acyclic matching
  • Linear-time algorithm
  • Matching
  • Minimum maximal acyclic matching

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science


Dive into the research topics of 'Minimum Maximal Acyclic Matching in Proper Interval Graphs'. Together they form a unique fingerprint.

Cite this