A parallel algorithm for finding minimum cutsets in reducible graphs

DOI10.1006/JPDC.1994.1004zbMath0807.68045OpenAlexW2012291190MaRDI QIDQ1328109

Eliezer Dekel, Jie Hu

Publication date: 1 March 1995

Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jpdc.1994.1004

zbMATH Keywords

reducible graphsminimal cutsets

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Distributed algorithms (68W15)

This page was built for publication: A parallel algorithm for finding minimum cutsets in reducible graphs