A simple linear-time recognition algorithm for weakly quasi-threshold graphs (Q659727): 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.1007/s00373-010-0983-0 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2058480081 / rank | |||
Normal rank | |||
Revision as of 14:37, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A simple linear-time recognition algorithm for weakly quasi-threshold graphs |
scientific article |
Statements
A simple linear-time recognition algorithm for weakly quasi-threshold graphs (English)
0 references
24 January 2012
0 references
Weakly quasi-threshold graphs
0 references
Cographs
0 references
Forbidden induced subgraphs
0 references
Recognition
0 references
Linear-time algorithms
0 references
