An \(O( n^{3})\)-time recognition algorithm for hhds-free graphs (Q2373437): 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-007-0706-3 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2083976285 / rank | |||
Normal rank | |||
Revision as of 15:38, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An \(O( n^{3})\)-time recognition algorithm for hhds-free graphs |
scientific article |
Statements
An \(O( n^{3})\)-time recognition algorithm for hhds-free graphs (English)
0 references
19 July 2007
0 references
Graph
0 references
Recognition algorithm
0 references
hhds-free
0 references
Perfectly orderable
0 references
