Recognizing \(i\)-triangulated graphs in \(O(mn)\) time (Q294870)
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: Recognizing i-triangulated graphs in O(mn) time |
scientific article; zbMATH DE number 6594153
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Recognizing \(i\)-triangulated graphs in \(O(mn)\) time |
scientific article; zbMATH DE number 6594153 |
Statements
Recognizing \(i\)-triangulated graphs in \(O(mn)\) time (English)
0 references
16 June 2016
0 references
recognition algorithm
0 references
breadth-first search
0 references
\(i\)-triangulated graph
0 references
graph algorithms
0 references
