scientific article; zbMATH DE number 7561372
From MaRDI portal
Publication:5091008
DOI10.4230/LIPIcs.ISAAC.2018.18MaRDI QIDQ5091008
Pavel Dvořák, Dušan Knop, Tomáš Toufar
Publication date: 21 July 2022
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (9)
A parameterized complexity view on collapsing \(k\)-cores ⋮ Iterated Type Partitions ⋮ Simplified algorithmic metatheorems beyond MSO: treewidth and neighborhood diversity ⋮ Immunization in the threshold model: a parameterized complexity study ⋮ Target set selection with maximum activation time ⋮ Solving target set selection with bounded thresholds faster than \(2^n\) ⋮ Partitioning graphs into induced subgraphs ⋮ Target set selection parameterized by vertex cover and more ⋮ On reconfigurability of target sets
Cites Work
- Unnamed Item
- Local majorities, coalitions and monopolies in graphs: A review
- Algorithmic meta-theorems for restrictions of treewidth
- Integer Programming with a Fixed Number of Variables
- On Tractable Cases of Target Set Selection
- Simpler Linear-Time Modular Decomposition Via Recursive Factorizing Permutations
This page was built for publication:
