Series - parallel graphs and depth-first search trees
From MaRDI portal
Publication:3219788
DOI10.1109/TCS.1984.1085460zbMath0556.68035MaRDI 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
05C05: Trees
68P10: Searching and sorting
68R10: Graph theory (including graph drawing) in computer science
94C15: Applications of graph theory to circuits and networks
Related Items
A tight relation between series-parallel graphs and bipartite distance hereditary graphs, DFS tree construction: Algorithms and characterizations, Recognition of DFS trees: Sequential and parallel algorithms with refined verifications, On the Galois Lattice of Bipartite Distance Hereditary Graphs