Pages that link to "Item:Q911287"
From MaRDI portal
The following pages link to Recognizing breadth-first search trees in linear time (Q911287):
Displaying 12 items.
- Recognition of DFS trees: Sequential and parallel algorithms with refined verifications (Q685690) (← links)
- Unrestricted and complete breadth-first search of trapezoid graphs in \(O(n)\) time (Q763538) (← links)
- The Level-Ancestor problem on pure pointer machines (Q1007543) (← links)
- Finding level-ancestors in trees (Q1329158) (← links)
- Semi-dynamic breadth-first search in digraphs (Q1589436) (← links)
- On the recognition of search trees generated by BFS and DFS (Q2087463) (← links)
- Recognizing graph search trees (Q2132337) (← links)
- Certification of breadth-first algorithms by extraction (Q2176671) (← links)
- The Recognition Problem of Graph Search Trees (Q4997136) (← links)
- Semi-dynamic shortest paths and breadth-first search in digraphs (Q5047157) (← links)
- (Q5874479) (← links)
- Recognizing LBFS trees of bipartite graphs (Q6551704) (← links)