An efficient parallel algorithm for shifting the root of a depth first spanning tree
From MaRDI portal
Publication:3725546
DOI10.1016/0196-6774(86)90040-4zbMath0594.68043MaRDI QIDQ3725546
Publication date: 1986
Published in: Journal of Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0196-6774(86)90040-4
68Q25: Analysis of algorithms and problem complexity
05C05: Trees
05-04: Software, source code, etc. for problems pertaining to combinatorics
Related Items
DFS tree construction: Algorithms and characterizations, Recognition of DFS trees: Sequential and parallel algorithms with refined verifications, On finding optimal and near-optimal lineal spanning trees, Parallel complexity of computing a maximal set of disjoint paths