Offensive alliances in signed graphs
From MaRDI portal
Publication:6636088
DOI10.1007/978-981-97-2340-9_20MaRDI QIDQ6636088
Kevin Mann, Xingqin Qi, Zhidan Feng, Henning Fernau
Publication date: 12 November 2024
Cites Work
- Unnamed Item
- Unnamed Item
- Correlation clustering
- Offensive \(r\)-alliances in graphs
- Which problems have strongly exponential complexity?
- Face covers and the genus problem for apex graphs
- On structural parameterizations of the offensive alliance problem
- Linear time algorithms for weighted offensive and powerful alliances in trees
- On defensive alliances and strong global offensive alliances
- Global offensive alliances in graphs and random graphs
- On the notion of balance of a signed graph
- Trees with equal global offensive k-alliance and k-domination numbers
- Bounds on the global offensive k-alliance number in graphs
- Offensive alliances in graphs
- On Problems as Hard as CNF-SAT
- The Parameterized Complexity of Domination-Type Problems and Application to Linear Codes
- Parameterized Algorithms
This page was built for publication: Offensive alliances in signed graphs
