Series - parallel graphs and depth-first search trees

DOI10.1109/TCS.1984.1085460MaRDI QIDQ3219788zbMATH OpenOpenAlexFDO

Authors Maciej M. Sysło

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

zbMATH Keywords

spanning trees

Mathematics Subject Classification ID

Trees (05C05) Searching and sorting (68P10) Graph theory (including graph drawing) in computer science (68R10) Applications of graph theory to circuits and networks (94C15)

Recommendations

• scientific article; zbMATH DE number 844157
• Recognition of DFS trees: Sequential and parallel algorithms with refined verifications
• On the fundamental cycle set graph
• On the existence of special depth first search trees
• A Nearly Optimal Parallel Algorithm for Constructing Depth First Spanning Trees in Planar Graphs

Cited in

(8)

• A recurrence template for several parameters in series-parallel graphs
• On the Galois Lattice of Bipartite Distance Hereditary Graphs
• On the fundamental cycle set graph
• Searching in Trees, Series-Parallel and Interval Orders
• A tight relation between series-parallel graphs and bipartite distance hereditary graphs
• Series-Parallel Operations with Alpha-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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3219788)