The following pages link to (Q4415792):
Displaying 5 items.
- A linear time algorithm for finding depth-first spanning trees on trapezoid graphs (Q287118) (← links)
- Unrestricted and complete breadth-first search of trapezoid graphs in \(O(n)\) time (Q763538) (← links)
- Recognizing breadth-first search trees in linear time (Q911287) (← links)
- An optimal PRAM algorithm for a spanning tree on trapezoid graphs. (Q1432796) (← links)
- (Q4376766) (← links)