A Linear-Time Algorithm for Maximum-Cardinality Matching on Cocomparability Graphs
Data Structures and Algorithms
2018-10-23 v3
Abstract
Finding maximum-cardinality matchings in undirected graphs is arguably one of the most central graph problems. For general m-edge and n-vertex graphs, it is well-known to be solvable in time. We develop a linear-time algorithm to find maximum-cardinality matchings on cocomparability graphs, a prominent subclass of perfect graphs that contains interval graphs as well as permutation graphs. Our algorithm is based on the recently discovered Lexicographic Depth First Search (LDFS).
Cite
@article{arxiv.1703.05598,
title = {A Linear-Time Algorithm for Maximum-Cardinality Matching on Cocomparability Graphs},
author = {George B. Mertzios and André Nichterlein and Rolf Niedermeier},
journal= {arXiv preprint arXiv:1703.05598},
year = {2018}
}
Comments
16 pages, 4 figures. to appear at SIDMA arXiv admin note: text overlap with arXiv:1609.08879