Structural parameterizations of vertex integrity

DOI10.1016/J.TCS.2024.114954MaRDI QIDQ6652467FDOQ6652467

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

Publication date: 12 December 2024

Published in: Theoretical Computer Science (Search for Journal in Brave)

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

• Fundamentals of parameterized complexity
• Title not available (Why is that?)
• Fixed-parameter tractability of graph modification problems for hereditary properties
• Graph Classes: A Survey
• Fixed-parameter algorithms for cluster vertex deletion
• Modular decomposition and transitive orientation
• Algorithmic meta-theorems for restrictions of treewidth
• Face covers and the genus problem for apex graphs
• Linear time solvable optimization problems on graphs of bounded clique-width
• Parametrized complexity theory.
• Approximating clique-width and branch-width
• Parameterized Algorithms
• Title not available (Why is that?)
• Twin-Cover: Beyond Vertex Cover in Parameterized Algorithmics
• Cluster vertex deletion: a parameterization between vertex cover and clique-width
• Measuring the vulnerability for classes of intersection graphs
• Parameterized Algorithms for Modular-Width
• A survey of integrity
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Bin packing with fixed number of bins revisited
• Finding Branch-Decompositions and Rank-Decompositions
• Approximating rank-width and clique-width quickly
• Some notes on bounded starwidth graphs
• On the computational complexity of vertex integrity and component order connectivity
• Vulnerability parameters of split graphs
• Safe sets in graphs: graph classes and structural parameters
• Safe number and integrity of graphs
• Parameterized Complexity of Safe Set
• Partitioning a graph into small pieces with applications to path transversal
• The complexity landscape of decompositional parameters for ILP: programs with few global variables and constraints
• Exploring the gap between treedepth and vertex cover through vertex integrity
• Title not available (Why is that?)
• 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

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