@article{453c5f35024542e8bd92d89c6f2b63b8,
title = "Finding a Maximum Matching in a Circular-Arc Graph",
abstract = " We present an O(n log n) algorithm for finding a maximum matching in a circular-arc graph. The best known algorithm for the same problem in general graphs takes O(√|V| |E|) time. ",
author = "Liang, {Y. Daniel} and Chongkye Rhee",
note = "We present an O(n log n) algorithm for finding a maximum matching in a circular-arc graph. The best known algorithm for the same problem in general gr...",
year = "1993",
month = mar,
day = "22",
doi = "10.1016/0020-0190(93)90117-R",
language = "American English",
volume = "45",
journal = "Information Processing Letters",
issn = "0020-0190",
publisher = "Elsevier B.V.",
}