Critical nodes for distance‐based connectivity and related problems in graphs

E-ISSN： 1097-0037|66|3|170-195

ISSN： 0028-3045

Source： NETWORKS: AN INTERNATIONAL JOURNAL, Vol.66, Iss.3, 2015-10, pp. : 170-195

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Branch and cut algorithms for detecting critical nodes in undirected graphs

By Di Summa Marco

Computational Optimization and Applications, Vol. 53, Iss. 3, 2012-12 ,pp. : 649-680

Springer Publishing Company

Access to resources Recommend Favorite

Possibilistic Merging and Distance-Based Fusion of Propositional Information

By Benferhat S.

Annals of Mathematics and Artificial Intelligence, Vol. 34, Iss. 1-3, 2002-03 ,pp. : 217-252

Springer Publishing Company

Access to resources Recommend Favorite

Distance‐based control of formations with hybrid communication topology

INTERNATIONAL JOURNAL OF ROBUST AND NONLINEAR CONTROL, Vol. 28, Iss. 3, 2018-02 ,pp. : 881-900

John Wiley & Sons Inc

Access to resources Recommend Favorite

A connectivity game for graphs

By Amer Rafael

Mathematical Methods of Operations Research, Vol. 60, Iss. 3, 2004-12 ,pp. : 453-470

Springer Publishing Company

Access to resources Recommend Favorite

Vector connectivity in graphs

NETWORKS: AN INTERNATIONAL JOURNAL, Vol. 63, Iss. 4, 2014-07 ,pp. : 277-285

John Wiley & Sons Inc

Access to resources Recommend Favorite