Small independent edge dominating sets in graphs of maximum degree three

Authors:
Grażyna Zwoźniak
Affiliations:
Institute of Computer Science, Wrocław University, Poland
Venue:
SOFSEM'06 Proceedings of the 32nd conference on Current Trends in Theory and Practice of Computer Science
Year:
2006

Citing 2
Cited 0

Minimum edge dominating sets

SIAM Journal on Discrete Mathematics
Approximation Algorithm for the Maximum Leaf Spanning Tree Problem for Cubic Graphs

ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we consider the problem of finding minimum independent edge dominating sets in graphs of maximum degree three. The problem is NP-hard. We present an algorithm which finds the dominating set of size at most 4n/9+1/3. Using this bound we achieve an approximation ratio of 40/27 for the minimum independent edge domination set problem in cubic graphs.