An \(O( n^{3})\)-time recognition algorithm for hhds-free graphs (Q2373437): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 19:10, 2 February 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
