An efficient parallel algorithm for shifting the root of a depth first spanning tree

DOI10.1016/0196-6774(86)90040-4zbMath0594.68043OpenAlexW2007923771MaRDI QIDQ3725546

Prasoon Tiwari

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

zbMATH Keywords

parallel computationdepth first spanning treeroot-shifting problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Trees (05C05) Software, source code, etc. for problems pertaining to combinatorics (05-04)

Related Items (4)

On finding optimal and near-optimal lineal spanning trees ⋮ DFS tree construction: Algorithms and characterizations ⋮ Parallel complexity of computing a maximal set of disjoint paths ⋮ Recognition of DFS trees: Sequential and parallel algorithms with refined verifications

This page was built for publication: An efficient parallel algorithm for shifting the root of a depth first spanning tree