A linear time algorithm for finding depth-first spanning trees on trapezoid graphs (Q287118): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank |
Revision as of 00:55, 5 March 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