An \(O( n^{3})\)-time recognition algorithm for hhds-free graphs (Q2373437)
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: An \(O( n^{3})\)-time recognition algorithm for hhds-free graphs |
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
