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

Full description

Saved in:

Bibliographic Details
Published in:	Algorithmica Vol. 88; no. 1
Main Authors:	Casel, Katrin, Friedrich, Tobias, Niklanovits, Aikaterini, Simonov, Kirill, Zeif, Ziena
Format:	Journal Article
Language:	English
Published:	New York Springer US 01.02.2026 Springer Nature B.V
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!