An \(O(nm)\)-time certifying algorithm for recognizing HHD-free graphs (Q714793)
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(nm)\)-time certifying algorithm for recognizing HHD-free graphs |
scientific article; zbMATH DE number 6093018
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An \(O(nm)\)-time certifying algorithm for recognizing HHD-free graphs |
scientific article; zbMATH DE number 6093018 |
Statements
An \(O(nm)\)-time certifying algorithm for recognizing HHD-free graphs (English)
0 references
11 October 2012
0 references
HHD-free graphs
0 references
perfectly orderable graphs
0 references
certifying algorithms
0 references
recognition
0 references
house-, hole- or domino-free
0 references
HDD free
0 references
0 references
0 references
