The algorithmic complexity of bondage and reinforcement problems in bipartite graphs
From MaRDI portal
Publication:2447764
DOI10.1016/j.tcs.2014.04.005zbMath1417.68070arXiv1403.2796OpenAlexW2125031419MaRDI QIDQ2447764
Publication date: 29 April 2014
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1403.2796
Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items
On the complexity of reinforcement in graphs ⋮ Complexity and bounds for disjunctive total bondage ⋮ Unnamed Item ⋮ The \(k\)-rainbow reinforcement numbers in graphs ⋮ On the complexity of the outer-connected bondage and the outer-connected reinforcement problems ⋮ Bondage numbers of Mycielski graphs ⋮ The total bondage numbers and efficient total dominations of vertex-transitive graphs ⋮ On the complexity of multiple bondage in graphs ⋮ The restrained k-rainbow reinforcement number of graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the complexity of the bondage and reinforcement problems
- A note on total reinforcement in graphs
- Restrained bondage in graphs
- A survey of selected recent results on total domination in graphs
- Reinforcement numbers of digraphs
- The NP-completeness of Steiner tree and dominating set for chordal bipartite graphs
- The bondage number of a graph
- On bondage numbers of graphs: a survey with some comments
- The total domination and total bondage numbers of extended de Bruijn and Kautz digraphs
- Total reinforcement number of a graph
- Total bondage number of a graph
- Total domination in graphs
- Theory and Application of Graphs
This page was built for publication: The algorithmic complexity of bondage and reinforcement problems in bipartite graphs
