An O(\(n\)) time algorithm for maximum matching on cographs (Q685476): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0020-0190(93)90230-7 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1966596093 / rank | |||
Normal rank | |||
Revision as of 00:51, 20 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
