Recognizing \(i\)-triangulated graphs in \(O(mn)\) time (Q294870): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / cites work | |||
| Property / cites work: Q3344031 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5341588 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3328583 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Algorithmic Aspects of Vertex Elimination on Graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3686753 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1491628531 / rank | |||
Normal rank | |||
Latest revision as of 08:55, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Recognizing \(i\)-triangulated graphs in \(O(mn)\) time |
scientific article |
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
