A linear time algorithm for finding depth-first spanning trees on trapezoid graphs (Q287118)
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: A linear time algorithm for finding depth-first spanning trees on trapezoid graphs |
scientific article; zbMATH DE number 6585435
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A linear time algorithm for finding depth-first spanning trees on trapezoid graphs |
scientific article; zbMATH DE number 6585435 |
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
0 references
0 references
0.9219382
0 references
0.91292584
0 references
0.9073801
0 references
0.8814198
0 references
0.88043165
0 references
