A linear time algorithm for finding depth-first spanning trees on trapezoid graphs (Q287118): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 05C85 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 68Q25 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 6585435 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
depth-first search | |||
| Property / zbMATH Keywords: depth-first search / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
spanning tree | |||
| Property / zbMATH Keywords: spanning tree / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
trapezoid graphs | |||
| Property / zbMATH Keywords: trapezoid graphs / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
permutation graphs | |||
| Property / zbMATH Keywords: permutation graphs / rank | |||
Normal rank | |||
Revision as of 19:54, 27 June 2023
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
