A linear-time recognition algorithm for \(P_{4}\)-reducible graphs (Q673108)
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: A linear-time recognition algorithm for Pā-reducible graphs |
scientific article; zbMATH DE number 985378
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A linear-time recognition algorithm for \(P_{4}\)-reducible graphs |
scientific article; zbMATH DE number 985378 |
Statements
A linear-time recognition algorithm for \(P_{4}\)-reducible graphs (English)
0 references
28 February 1997
0 references
\(P_ 4\)-reducible graphs
0 references
cographs
0 references
0.8630277514457703
0 references
0.8589479923248291
0 references
0.8561283349990845
0 references
