Efficient algorithms for the weighted k-domination problem and its variants on interval and circular-arc graphs

Conference paper

M.S. Chang and C.L. Lu

Proceedings of the 7th Workshop on on Discrete Mathematics and Theory of Computation, p.48

1993

Abstract

k-dominating set;matching;interval graphs;circular-arc graphs

1 Record Views

Title: Efficient algorithms for the weighted k-domination problem and its variants on interval and circular-arc graphs
Creators - without role: M.S. Chang
C.L. Lu - 國立清華大學電機資訊學院資訊工程學系
Publication Details: Proceedings of the 7th Workshop on on Discrete Mathematics and Theory of Computation, p.48
Identifiers: 9957769424706774
Academic Unit: Department of Computer Science, College of Electrical Engineering and Computer Science, National Tsing Hua University
Language: Traditional Chinese
Resource Type: Conference paper