Combining Crown Structures for Vulnerability Measures

Over the past decades, various metrics have emerged in graph theory to grasp the complex nature of network vulnerability. In this paper, we study two specific measures: (weighted) vertex integrity (wVI) and (weighted) component order connectivity (wCOC). These measures not only evaluate the number o...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Algorithmica Jg. 88; H. 1
Hauptverfasser:	Casel, Katrin, Friedrich, Tobias, Niklanovits, Aikaterini, Simonov, Kirill, Zeif, Ziena
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York Springer US 01.02.2026 Springer Nature B.V
Schlagworte:	Algorithm Analysis and Problem Complexity Algorithms Apexes Combinatorial analysis Computer Science Computer Systems Organization and Communication Networks Data Structures and Information Theory Decomposition Fields (mathematics) Graph theory Mathematics of Computing Polynomials Theory of Computation Crown decomposition Component order connectivity Kernelization Vertex Integrity
ISSN:	0178-4617, 1432-0541
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!