Offensive alliances in signed graphs
From MaRDI portal
Cites work
- A fast algorithm for powerful alliances in trees
- A note on the fine-grained complexity of MIS on regular graphs
- Bounds on the global offensive k-alliance number in graphs
- Correlation clustering
- Defensive alliances in signed networks
- Domino Treewidth
- Face covers and the genus problem for apex graphs
- Finding odd cycle transversals.
- Global defensive alliances in graphs
- Global offensive alliances in graphs and random graphs
- scientific article; zbMATH DE number 1375581 (Why is no real title available?)
- scientific article; zbMATH DE number 1305522 (Why is no real title available?)
- scientific article; zbMATH DE number 2104820 (Why is no real title available?)
- Linear time algorithms for weighted offensive and powerful alliances in trees
- Lower bounds based on the exponential time hypothesis
- Offensive \(r\)-alliances in graphs
- Offensive alliances in graphs
- Offensive alliances in graphs
- Offensive alliances in signed graphs
- On defensive alliances and strong global offensive alliances
- On problems as hard as CNF-SAT
- On structural parameterizations of the offensive alliance problem
- On the notion of balance of a signed graph
- Parameterized algorithms
- Powerful alliances in graphs
- The parameterized complexity of domination-type problems and application to linear codes
- The Turing way to parameterized complexity
- Trees with equal global offensive k-alliance and k-domination numbers
- Which problems have strongly exponential complexity?
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 Q6864005)
