Pages that link to "Item:Q3725546"
From MaRDI portal
The following pages link to An efficient parallel algorithm for shifting the root of a depth first spanning tree (Q3725546):
Displayed 4 items.
- Recognition of DFS trees: Sequential and parallel algorithms with refined verifications (Q685690) (← links)
- On finding optimal and near-optimal lineal spanning trees (Q1105381) (← links)
- Parallel complexity of computing a maximal set of disjoint paths (Q1186594) (← links)
- DFS tree construction: Algorithms and characterizations (Q6199456) (← links)