Formal methods of paralleling the Tarjan algorithm

zbMATH Open1164.68363MaRDI QIDQ3608079FDOQ3608079

Authors: S. D. Pogorilyj, S. I. Lozytskyj 

Publication date: 28 February 2009

Recommendations

• scientific article; zbMATH DE number 5879017
• On finding the strongly connected components in a directed graph
• Concurrent determination of connected components
• A parallel realization of the Edmonds-Karp algorithm
• scientific article; zbMATH DE number 2107027

zbMATH Keywords

optimizationdirected graphTarjan algorithm

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10)

This page was built for publication: Formal methods of paralleling the Tarjan algorithm

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