A linear time algorithm for finding depth-first spanning trees on trapezoid graphs (Q287118): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/s0020-0190(97)00088-4 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1979383396 / rank | |||
Normal rank | |||
Latest revision as of 09:07, 30 July 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
0 references
0 references
