Name
Abstract | ||
|---|---|---|
We present an $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. |
Year | DOI | Venue |
|---|---|---|
1995 | 10.1007/s002360050033 | Acta Inf. |
Keywords | Field | DocType |
Information System,Operating System,Data Structure,Communication Network,Information Theory | Permutation graph,Discrete mathematics,Combinatorics,Line graph,Hypercube graph,Circle graph,Graph power,Cyclic permutation,Factor-critical graph,Mathematics,Complement graph | Journal |
Volume | Issue | ISSN |
32 | 8 | 0001-5903 |
Citations | PageRank | References |
1 | 0.40 | 6 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Chongkye Rhee | 1 | 20 | 3.39 |
| Y. Daniel Liang | 2 | 153 | 14.93 |