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

This study considers a class of critical node detection problems that involves minimization of a distance‐based connectivity measure of a given unweighted graph via the removal of a subset of nodes (referred to as critical nodes) subject to a budgetary constraint. The distance‐based connectivity mea...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Networks 2015-10, Vol.66 (3), p.170-195
Hauptverfasser:	Veremyev, Alexander, Prokopyev, Oleg A., Pasiliao, Eduardo L.
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Budgeting centrality measures Computational efficiency Computing time critical node detection distance-based metrics graph efficiency Graphs Harary index integer programming Mathematical models Minimization network interdiction Networks Optimization s-club social networks Wiener index
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!