An \(O(n)\) time algorithm for maximum matching in \(P_{4}\)-tidy graphs (Q287094)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An \(O(n)\) time algorithm for maximum matching in \(P_{4}\)-tidy graphs |
scientific article |
Statements
An \(O(n)\) time algorithm for maximum matching in \(P_{4}\)-tidy graphs (English)
0 references
26 May 2016
0 references
