Finding a maximum matching in a permutation graph
We present an \({\mathcal O} (n \log \log n)\) time algorithm for finding a maximum matching in a permutation graph with \(n\) vertices, assuming that the input graph is represented by a permutation.
scientific article; zbMATH DE number 818364
scientific article