Complexity of secure sets
From MaRDI portal
Publication:722534
DOI10.1007/s00453-017-0358-5zbMath1391.68047arXiv1411.6549OpenAlexW2749113736WikidataQ55312596 ScholiaQ55312596MaRDI QIDQ722534
Stefan Woltran, Bernhard Bliem
Publication date: 26 July 2018
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1411.6549
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (3)
Defensive alliances in graphs of bounded treewidth ⋮ Problems hard for treewidth but easy for stable gonality ⋮ On the security number of the Cartesian product of graphs
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Complexity of clique coloring and related problems
- Rooted secure sets of trees
- Global secure sets of grid-like graphs
- Graph classes and the complexity of the graph orientation minimizing the maximum weighted outdegree
- Graph minors. III. Planar tree-width
- Treewidth computations. I: Upper bounds
- Narrowness, pathwidth, and their application in natural language processing
- All structured programs have small tree width and good register allocation
- Treewidth. Computations and approximations
- Global defensive alliances in graphs
- Generalizations of matched CNF formulas
- Security in graphs
- Parametrized complexity theory.
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- Complexity of Secure Sets
- The D-FLAT System for Dynamic Programming on Tree Decompositions
- Capacitated Domination and Covering: A Parameterized Perspective
- Complexity of Finding Embeddings in a k-Tree
- Parameterized Algorithms
- A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
This page was built for publication: Complexity of secure sets
