期刊
ALGORITHMS AND DISCRETE APPLIED MATHEMATICS, CALDAM 2023
卷 13947, 期 -, 页码 377-388出版社
SPRINGER INTERNATIONAL PUBLISHING AG
DOI: 10.1007/978-3-031-25211-2_29
关键词
Matching; Acyclic matching; Minimum maximal acyclic matching; Linear-time algorithm
This paper investigates the problem of MIN-MAX-ACY-Matching and presents a linear-time algorithm to solve it in proper interval graphs.
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.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据