A linear time algorithm for finding depth-first spanning trees on trapezoid graphs (Q287118): Difference between revisions
From MaRDI portal
Changed an Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 03:03, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A linear time algorithm for finding depth-first spanning trees on trapezoid graphs |
scientific article |
Statements
A linear time algorithm for finding depth-first spanning trees on trapezoid graphs (English)
0 references
26 May 2016
0 references
depth-first search
0 references
spanning tree
0 references
trapezoid graphs
0 references
permutation graphs
0 references
