Structural parameterization of alliance problems

DOI10.1007/978-3-031-25211-2_34OpenAlexW4318023135MaRDI QIDQ6132561FDOQ6132561

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

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

Cited In (2)

• Title not available (Why is that?)
• 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)