Finding a maximum matching in a permutation graph (Q1902306)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 818364
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Finding a maximum matching in a permutation graph |
scientific article; zbMATH DE number 818364 |
Statements
Finding a maximum matching in a permutation graph (English)
0 references
20 November 1995
0 references
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.
0 references
maximum matching
0 references
permutation graph
0 references
0.9102069
0 references
0 references
0.8935277
0 references
0.8930575
0 references
0.89147586
0 references
0.89071745
0 references
0 references
0.8866327
0 references
0.88393396
0 references
0.88194823
0 references
