A simple variant of node connectivity is NP-complete

DOI10.1080/00207168608803546MaRDI QIDQ3802606zbMATH OpenOpenAlexFDO

Authors K. V. S. Ramarao

Publication date 1986

Published in International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/00207168608803546

zbMATH Keywords

2NP- completenessdistributed systemsfault-tolerancenetwork partitionsnode connectivity

Mathematics Subject Classification ID

Theory of software (68N99) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Applications of graph theory to circuits and networks (94C15)

Recommendations

• scientific article; zbMATH DE number 26483
• The Complexity of the Residual Node Connectedness Reliability Problem
• Node-and edge-deletion NP-complete problems
• scientific article; zbMATH DE number 176146
• scientific article; zbMATH DE number 3848612

Cites work

• An Algorithm for Determining Whether the Connectivity of a Graph is at Leastk
• An Information-Based Model for Failure-Handling in Distributed Database Systems
• Edge-Deletion Problems
• Finding the Vertex Connectivity of Graphs
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Network Flow and Testing Graph Connectivity
• Node-Deletion NP-Complete Problems
• The node-deletion problem for hereditary properties is NP-complete

Cited in

(1)

• Theory-Contraction is NP-Complete

This page was built for publication: A simple variant of node connectivity is NP-complete

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