Parallel Algorithms for Reducible Flow Graphs

DOI10.1006/JAGM.1996.0820zbMATH Open0866.68044OpenAlexW2956049318MaRDI QIDQ3128985FDOQ3128985

Authors: Vijaya Ramachandran 

Publication date: 6 July 1997

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jagm.1996.0820

Recommendations

• Finding a minimum feedback arc set in reducible flow graphs
• A parallel algorithm for finding minimum cutsets in reducible graphs
• Efficient parallel algorithms for path problems in directed graphs
• Parallelism and the feedback vertex set problem

zbMATH Keywords

NC algorithms

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15)

Cited In (7)

• An efficient algorithm for finding maximum cycle packings in reducible flow graphs
• More efficient parallel flow algorithms
• Processor optimization for flow graphs
• A parallel algorithm for computing the flow complex
• Parallelism and the feedback vertex set problem
• Folklore confirmed
• Map-Reduce process algebra: a formalism to describe directed acyclic graph task-based jobs in parallel environments

This page was built for publication: Parallel Algorithms for Reducible Flow Graphs

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