Series - parallel graphs and depth-first search trees
From MaRDI portal
Publication:3219788
DOI10.1109/TCS.1984.1085460zbMath0556.68035OpenAlexW2064385734MaRDI QIDQ3219788
Publication date: 1984
Published in: IEEE Transactions on Circuits and Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tcs.1984.1085460
Trees (05C05) Searching and sorting (68P10) Graph theory (including graph drawing) in computer science (68R10) Applications of graph theory to circuits and networks (94C15)
Related Items (4)
A tight relation between series-parallel graphs and bipartite distance hereditary graphs ⋮ On the Galois Lattice of Bipartite Distance Hereditary Graphs ⋮ DFS tree construction: Algorithms and characterizations ⋮ Recognition of DFS trees: Sequential and parallel algorithms with refined verifications
This page was built for publication: Series - parallel graphs and depth-first search trees
