Structural parameterizations of vertex integrity (best paper)

DOI10.1007/978-981-97-0566-5_29MaRDI QIDQ6575412

Yasuaki Kobayashi, Yota Otachi, Tesshu Hanaka, Tatsuya Gima, Hirotaka Ono, Ryota Murai

Publication date: 19 July 2024

zbMATH Keywords

parameterized complexityvertex integritystructural graph parametervulnerability of graphs

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Parameterized complexity, tractability and kernelization (68Q27)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the computational complexity of vertex integrity and component order connectivity
• Fixed-parameter algorithms for cluster vertex deletion
• A survey of integrity
• Modular decomposition and transitive orientation
• Measuring the vulnerability for classes of intersection graphs
• Safe sets in graphs: graph classes and structural parameters
• Safe number and integrity of graphs
• The complexity landscape of decompositional parameters for ILP: programs with few global variables and constraints
• Partitioning a graph into small pieces with applications to path transversal
• Some notes on bounded starwidth graphs
• Parameterized Algorithms for Modular-Width
• Cluster Vertex Deletion: A Parameterization between Vertex Cover and Clique-Width
• Parameterized Complexity of Safe Set
• Vulnerability parameters of split graphs
• Parameterized Algorithms
• Exploring the gap between treedepth and vertex cover through vertex integrity
• Extended MSO model checking via small vertex integrity
• Fully polynomial-time algorithms parameterized by vertex integrity using fast matrix multiplication

This page was built for publication: Structural parameterizations of vertex integrity (best paper)