An O(\(n\)) time algorithm for maximum matching on cographs (Q685476): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 00:59, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An O(\(n\)) time algorithm for maximum matching on cographs |
scientific article |
Statements
An O(\(n\)) time algorithm for maximum matching on cographs (English)
0 references
17 October 1993
0 references
maximum matching
0 references
cographs
0 references
