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...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Algorithmica Ročník 88; číslo 1
Hlavní autori:	Casel, Katrin, Friedrich, Tobias, Niklanovits, Aikaterini, Simonov, Kirill, Zeif, Ziena
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York Springer US 01.02.2026 Springer Nature B.V
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!