Abstract
The weighted independent domination problem in trapezoid graphs was solved in O(n2) time [1]; the weighted efficient domination problem in trapezoid graphs was solved in O(n log log n + m) time 8, where ¯m denotes the number of edges in the complement of the trapezoid graph. In this paper, we show that the minimum weighted independent dominating set and the minimum weighted efficient dominating set in trapezoid graphs can both be found in O(n log n) time. Both of the algorithms require only O(n) space. Since ¯m can be as large as Ω(n2), comparing to previous results, our algorithms clearly give more efficient solutions to the related problems.
Supported in part by the National Science Council, Taiwan, R.O.C, grant NSC-88-2213-E-126-005.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
K. Arvind and C. Pandu Rangan. Efficient algorithms for domination problems on cocomparability graphs. Manuscript, 1990.
M. J. Atallah and S. R. Kosaraju. An efficient algorithm for maxdominance, with applications. Algorithmica, 4:221–236, 1989.
N. Biggs. Perfect codes in graphs. J. Combin. Theory Ser. B, 15:289–296, 1973.
M.-S. Chang. Weighted domination of cocomparability graphs. Discr. Applied Math., 80:135–148, 1997.
I. Dagan, M.C. Golumbic, and R.Y. Pinter. Trapezoid graphs and their coloring. Discr. Applied Math., 21:35–46, 1988.
Felsner, Muller, and Wernisch. Trapezoid graphs and generalizations, geometry and algorithms. Discr. Applied Math., 74, 1997.
T.W. Haynes, S.T. Hedetniemi, and P.J. Slater. Fundamentals of Domination in Graphs. Marcel Dekker, Inc., N. Y., 1998.
Y. D. Liang, C.-L. Lu, and C.-Y. Tang. Efficient domination on permutation graphs and trapezoid graphs. In COCOON’97, pages 232–241, 1997.
Y. Daniel Liang. Dominations in trapezoid graphs. Information Processing Letters, 52(6):309–315, December 1994.
M. Livingston and Q.F. Stout. Perfect dominating sets. Congr. Numer., 79:187–203, 1990.
T.-H. Ma and J.P. Spinrad. An O(n2) time algorithm for the 2-chain cover problem and related problems. In Proc. 2nd ACM-SIAM Symp. Discrete Algorithms, pages 363–372, 1991.
M. H. Overmars and J. van Leeuwen. Maintenance of configuration in the plane. Journal of Computer and Systems Science, 23:166–204, 1981.
Anand Srinivasan, M.S. Chang, K. Madhukar, and C. Pandu Rangan. Efficient algorithms for the weighted domination problems on trapezoid graphs. Manuscript, 1996.
G. Steiner. Polynomial time algorithm for finding a Hamiltonian cycle in the incomparability graph. Manuscript, 1992.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lin, YL. (1998). Fast Algorithms for Independent Domination and Efficient Domination in Trapezoid Graphs. In: Chwa, KY., Ibarra, O.H. (eds) Algorithms and Computation. ISAAC 1998. Lecture Notes in Computer Science, vol 1533. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-49381-6_29
Download citation
DOI: https://doi.org/10.1007/3-540-49381-6_29
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65385-1
Online ISBN: 978-3-540-49381-5
eBook Packages: Springer Book Archive