A Linear Recognition Algorithm for Cographs (Q3694709)
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 3919836
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A Linear Recognition Algorithm for Cographs |
scientific article; zbMATH DE number 3919836 |
Statements
A Linear Recognition Algorithm for Cographs (English)
0 references
1985
0 references
permutation graphs
0 references
perfect graphs
0 references
examination scheduling
0 references
automatic clustering of index terms
0 references
cotree
0 references
chromatic number
0 references
clique determination
0 references
minimum weight domination
0 references
isomorphism
0 references
minimum fill-in
0 references
Hamiltonicity
0 references
linear time algorithm
0 references
0.89864182472229
0 references
0.8650981187820435
0 references
0.8602200150489807
0 references
