Recognizing tenacious graphs is NP-hard.

MaRDI QIDQ5502385zbMATH OpenFDO

Authors Seyed Morteza Dadvand, Dara Moazzami, Ali Moeini

Publication date 26 August 2015

zbMATH Keywords

NP-completenesstenacityvulnerability

Mathematics Subject Classification ID

Paths and cycles (05C38) Connectivity (05C40) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Recommendations

• scientific article; zbMATH DE number 6770058
• Tenacity and the maximum network
• Recognizing tough graphs is NP-hard
• scientific article; zbMATH DE number 861347
• Computing the tenacity of some graphs

Cited in

(5)

• On the complexity of recognizing tough graphs
• On the first-order edge tenacity of a graph
• scientific article; zbMATH DE number 6770058 (Why is no real title available?)
• Computing the weighted neighbor isolated tenacity of interval graphs in polynomial time
• Recognizing tough graphs is NP-hard

This page was built for publication: Recognizing tenacious graphs is NP-hard.

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