Unrestricted and complete breadth-first search of trapezoid graphs in \(O(n)\) time (Q763538)
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: Unrestricted and complete breadth-first search of trapezoid graphs in O(n) time |
scientific article; zbMATH DE number 6013742
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Unrestricted and complete breadth-first search of trapezoid graphs in \(O(n)\) time |
scientific article; zbMATH DE number 6013742 |
Statements
Unrestricted and complete breadth-first search of trapezoid graphs in \(O(n)\) time (English)
0 references
12 March 2012
0 references
breadth-first search (BFS)
0 references
trapezoid graphs
0 references
permutation graphs
0 references
interval graphs
0 references
shortest paths
0 references
graph algorithms
0 references
BFS tree
0 references
0 references
