An O(\(n\)) time algorithm for maximum matching on cographs (Q685476)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An O(n) time algorithm for maximum matching on cographs |
scientific article; zbMATH DE number 417391
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An O(\(n\)) time algorithm for maximum matching on cographs |
scientific article; zbMATH DE number 417391 |
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
0 references
