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 the normal view instead:
scientific article; zbMATH DE number 5172581
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An \(O( n^{3})\)-time recognition algorithm for hhds-free graphs |
scientific article; zbMATH DE number 5172581 |
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
0.94839054
0 references
0.94839054
0 references
0.92283154
0 references
0.8929952
0 references
0.89025605
0 references
0.8751412
0 references
0.8706984
0 references
0 references
0.8583976
0 references
0.8583976
0 references
