An O(nm)-Time Certifying Algorithm for Recognizing HHD-Free Graphs (Q3612594)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An O(nm)-Time Certifying Algorithm for Recognizing HHD-Free Graphs |
scientific article |
Statements
An O(nm)-Time Certifying Algorithm for Recognizing HHD-Free Graphs (English)
0 references
10 March 2009
0 references
HHD-free graphs
0 references
perfectly orderable graphs
0 references
certifying algorithms
0 references
recognition
0 references
