Structural parameterizations of vertex integrity (best paper)

DOI10.1007/978-981-97-0566-5_29MaRDI QIDQ6575412zbMATH OpenFDO

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

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)

Recommendations

• Structural parameterizations of vertex integrity
• Exploring the gap between treedepth and vertex cover through vertex integrity
• Measures of vulnerability–the integrity family
• Vertex-neighbor-integrity of composition graph \(P_m[G]\)

Cites work

• scientific article; zbMATH DE number 4130410 (Why is no real title available?)
• scientific article; zbMATH DE number 4035869 (Why is no real title available?)
• scientific article; zbMATH DE number 4053662 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 7788607 (Why is no real title available?)
• A survey of integrity
• Cluster vertex deletion: a parameterization between vertex cover and clique-width
• Exploring the gap between treedepth and vertex cover through vertex integrity
• Extended MSO model checking via small vertex integrity
• Fixed-parameter algorithms for cluster vertex deletion
• Fully polynomial-time algorithms parameterized by vertex integrity using fast matrix multiplication
• Measuring the vulnerability for classes of intersection graphs
• Modular decomposition and transitive orientation
• Parameterized Algorithms for Modular-Width
• Parameterized algorithms
• Parameterized complexity of safe set
• Partitioning a graph into small pieces with applications to path transversal
• Safe number and integrity of graphs
• Safe sets in graphs: graph classes and structural parameters
• Some notes on bounded starwidth graphs
• The complexity landscape of decompositional parameters for ILP: programs with few global variables and constraints
• Vulnerability parameters of split graphs

Cited in

(2)

• Exploring the gap between treedepth and vertex cover through vertex integrity
• Structural parameterizations of vertex integrity

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6575412)