The complexity of the reliable connectivity problem

DOI10.1016/0020-0190(91)90023-BzbMath0741.68057OpenAlexW1987742187MaRDI QIDQ1183401

Dimitris Kavadias, Lefteris M. Kirousis, Paul G. Spirakis

Publication date: 28 June 1992

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(91)90023-b

zbMATH Keywords

reliabilitycombinatorial problemsparallel algorithmsgraph connectivity\(P\)-completeness

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Cites Work

• Edge-Deletion Problems
• Unnamed Item

This page was built for publication: The complexity of the reliable connectivity problem