scientific article; zbMATH DE number 6475962
From MaRDI portal
Publication:5502385
zbMath1340.05144MaRDI QIDQ5502385
Dara Moazzami, Ali Moeini, Seyed Morteza Dadvand
Publication date: 26 August 2015
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Paths and cycles (05C38) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Connectivity (05C40)
Related Items (2)
On the first-order edge tenacity of a graph ⋮ Computing the weighted neighbor isolated tenacity of interval graphs in polynomial time
This page was built for publication: