Article ID Journal Published Year Pages File Type
4949599 Discrete Applied Mathematics 2017 7 Pages PDF
Abstract
In this paper, we show that the problems for all variants are efficiently solvable for much larger graph classes. We present a polynomial-time algorithm for graphs of bounded clique-width. We also show that the problem is fixed-parameter tractable when parameterized by the vertex cover number.
Keywords
Related Topics
Physical Sciences and Engineering Computer Science Computational Theory and Mathematics
Preview
Alliances in graphs of bounded clique-width
Authors
, ,