Sciweavers

Share
SIAMCOMP
1998

Efficient Algorithms for the Domination Problems on Interval and Circular-Arc Graphs

10 years 2 months ago
Efficient Algorithms for the Domination Problems on Interval and Circular-Arc Graphs
This paper first presents a unified approach to design efficient algorithms for the weighted domination problem and its three variants, i.e., the weighted independent, connected, and total domination problems, on interval graphs. Given an interval model with endpoints sorted, these algorithms run in time O(n) or O(n log log n) where n is the number of vertices. The results are then extended to solve the same problems on circular-arc graphs in O(n+m) time where m is the number of edges of the input graph. Key words. interval graphs, circular-arc graphs, domination, graph algorithms AMS subject classifications. 05C85, 68Q25, 68Q20, 68R10, 90C27 PII. S0097539792238431
Maw-Shang Chang
Added 23 Dec 2010
Updated 23 Dec 2010
Type Journal
Year 1998
Where SIAMCOMP
Authors Maw-Shang Chang
Comments (0)
books