Computing the differential of a graph: Hardness, approximability and exact algorithms

Authors:
S. Bermudo;H. Fernau
Affiliations:
Department of Economy, Quantitative Methods and Economic History, Pablo de Olavide University, Carretera de Utrera Km. 1, 41013-Sevilla, Spain;Fachbereich 4, Abteilung Informatik, Universität Trier, D-54286 Trier, Germany
Venue:
Discrete Applied Mathematics
Year:
2014

Citing 22
Cited 0

Maximum bounded 3-dimensional matching is MAX SNP-complete

Information Processing Letters
Proof verification and the hardness of approximation problems

Journal of the ACM (JACM)
The toughness of split graphs

Discrete Mathematics
Approximation algorithms

Approximation algorithms
Mining the network value of customers

Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Measure and conquer: a simple O(20.288n) independent set algorithm

SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Solving Connected Dominating Set Faster than 2 n

Algorithmica - Parameterized and Exact Algorithms
Combinatorial bounds via measure and conquer: Bounding minimal dominating sets and applications

ACM Transactions on Algorithms (TALG)
Efficiency in exponential time for domination-type problems

Discrete Applied Mathematics
A measure & conquer approach for the analysis of exact algorithms

Journal of the ACM (JACM)
Searching Trees: An Essay

TAMC '09 Proceedings of the 6th Annual Conference on Theory and Applications of Models of Computation
An approximation algorithm for maximum triangle packing

Discrete Applied Mathematics
A tighter bound for counting max-weight solutions to 2SAT instances

IWPEC'08 Proceedings of the 3rd international conference on Parameterized and exact computation
Exact Exponential Algorithms

Exact Exponential Algorithms
Breaking the 2n-barrier for Irredundance: Two lines of attack

Journal of Discrete Algorithms
Exact algorithms for dominating set

Discrete Applied Mathematics
An exact algorithm for the Maximum Leaf Spanning Tree problem

Theoretical Computer Science
Nonblocker: parameterized algorithmics for minimum dominating set

SOFSEM'06 Proceedings of the 32nd conference on Current Trends in Theory and Practice of Computer Science
Fast Algorithms for max independent set

Algorithmica
An Exact Exponential Time Algorithm for Power Dominating Set

Algorithmica
Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties

Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties

Quantified Score

Hi-index	0.04

Visualization

Abstract

We are studying computational complexity aspects of the differential of a graph, a graph parameter previously introduced to model ways of influencing a network. We obtain NP hardness results also for very special graph classes, such as split graphs and cubic graphs. This motivates to further classify this problem in terms of approximability. Here, one of our results shows MAXSNP completeness for the corresponding maximization problem on subcubic graphs. Moreover, we also provide a Measure & Conquer analysis for an exact moderately exponential-time algorithm that computes that graph parameter in time O(1.755^n) on a graph of order n.