Pages that link to "Item:Q287118"
From MaRDI portal
The following pages link to A linear time algorithm for finding depth-first spanning trees on trapezoid graphs (Q287118):
Displaying 6 items.
- 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)
- Efficient algorithms for finding depth-first and breadth-first search trees in permutation graphs (Q1313714) (← links)
- A simple optimal parallel algorithm for constructing a spanning tree of a trapezoid graph (Q3545835) (← links)
- (Q4376766) (← links)
- (Q4415792) (← links)