(Total) Vector Domination for Graphs with Bounded Branchwidth
From MaRDI portal
Publication:5405043
DOI10.1007/978-3-642-54423-1_21zbMath1405.68248arXiv1306.5041OpenAlexW1495533257MaRDI QIDQ5405043
Hirotaka Ono, Yushi Uno, Toshimasa Ishii
Publication date: 31 March 2014
Published in: LATIN 2014: Theoretical Informatics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1306.5041
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (2)
Subexponential Fixed-Parameter Algorithms for Partial Vector Domination ⋮ Subexponential fixed-parameter algorithms for partial vector domination
This page was built for publication: (Total) Vector Domination for Graphs with Bounded Branchwidth