Department of Mathematics, National Taiwan UniversityYeh, Hong-GwaHong-GwaYehChang, Gerard-J.Gerard-J.Chang2006-09-272018-06-282006-09-272018-06-282001http://ntur.lib.ntu.edu.tw//handle/246246/20060927121112492145A graph is distance-hereditary if the distance between any two vertices in a connected induced subgraph is the same as in the original graph. This paper presents e-cient algorithms for solvingthe weighted connected k-domination & the weighted k-dominatingclique problems in distance-hereditary graphs.application/pdf89275 bytesapplication/pdfzh-TWDistance-hereditary graphConnected k-dominationk-dominating cliqueAlgorithmWeighted connected k-domination and weighted k-dominating clique in distance-hereditary graphsjournal articlehttp://ntur.lib.ntu.edu.tw/bitstream/246246/20060927121112492145/1/68.pdf