Offensive alliances in signed graphs

DOI10.1007/978-981-97-2340-9_20MaRDI QIDQ6636088FDOQ6636088

Kevin Mann, Xingqin Qi, Zhidan Feng, Henning Fernau

Publication date: 12 November 2024

zbMATH Keywords

signed graphparameterized complexityfixed parameter tractableoffensive alliance

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• On the notion of balance of a signed graph
• Correlation clustering
• Which problems have strongly exponential complexity?
• Face covers and the genus problem for apex graphs
• On Problems as Hard as CNF-SAT
• Parameterized Algorithms
• Offensive \(r\)-alliances in graphs
• Offensive alliances in graphs
• Global offensive alliances in graphs and random graphs
• Trees with equal global offensive k-alliance and k-domination numbers
• Bounds on the global offensive k-alliance number in graphs
• The Parameterized Complexity of Domination-Type Problems and Application to Linear Codes
• 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

This page was built for publication: Offensive alliances in signed graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6636088)