Structural parameterization of alliance problems

DOI10.1007/978-3-031-25211-2_34MaRDI QIDQ6132561zbMATH OpenOpenAlexFDO

Authors Sangam Balchandar Reddy, Anjeneya Swami Kare

Publication date 17 August 2023

Published in Algorithms and Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-031-25211-2_34

zbMATH Keywords

offensive alliancedefensive alliancepowerful alliancetwin coverdistance to clique

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites work

• scientific article; zbMATH DE number 2077650 (Why is no real title available?)
• scientific article; zbMATH DE number 2104820 (Why is no real title available?)
• Alliances in graphs of bounded clique-width
• Defensive alliances in graphs
• Defensive alliances in graphs of bounded treewidth
• Global alliances and independence in trees
• Global defensive alliances of trees and Cartesian product of paths and cycles
• Graph Layout Problems Parameterized by Vertex Cover
• Improved upper bounds for vertex cover
• Integer Programming with a Fixed Number of Variables
• Minkowski's Convex Body Theorem and Integer Programming
• Offensive \(r\)-alliances in graphs
• On the complement graph and defensive \(k\)-alliances
• Parameterized algorithms
• Parameterized complexity of locally minimal defensive alliances
• The algorithmic complexity of alliances in graphs
• Twin-Cover: Beyond Vertex Cover in Parameterized Algorithmics

Cited in

(3)

• scientific article; zbMATH DE number 5127204 (Why is no real title available?)
• On the tractability of defensive alliance problem
• Alliances and Related Domination Parameters

This page was built for publication: Structural parameterization of alliance problems

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