Weighted independent perfect domination on cocomparability graphs-Reference-Cited by-同舟云学术

Weighted independent perfect domination on cocomparability graphs

Published:1993 Issue: Volume: Page:506-514
ISSN:0302-9743
Container-title:Algorithms and Computation
language:
Short-container-title:

Author:

Chang Gerard J.,Pandu Rangan C.,Coorg Satyan R.

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-57568-5_282.pdf

Reference22 articles.

1. K. Arvind and C. Pandu Rangan, Efficient algorithms for domination problems on cocompaxability graphs, Technical Report TR-TCS-90-18 (1990), Department of Computer Science and Engineering, Indian Institute of Technology, Madras.

2. D. W. Bange, A. E. Barkauskas, and P. T. Slater, Efficient dominating sets in graphs, Applications of Discrete Mathematics, R. D. Ringeisen and F. S. Roberts, eds., SIAM, Philad. (1988)189–199.

3. A. A. Bertossi, Total domination in interval graphs, Inform. Processing Letters 23 (1986) 131–134.

4. A. A. Bertossi, On the domatic number of interval graph, Inform. Processing Letters 28 (1988) 275–280.

5. A. A. Bertossi and A. Gori, Total domination and irredundance in weighted interval graphs, SIAM J. Disc. Math. 1 (1988) 317–327.

Cited by 7 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Efficient Guarding of Polygons and Terrains;Frontiers in Algorithmics;2019

2. A Tight Bound on the Number of Mobile Servers to Guarantee the Mutual Transferability Among Dominating Configurations;Algorithms and Computation;2005

3. Minus domination in small-degree graphs;Discrete Applied Mathematics;2001-02

4. Minus Domination in Small-Degree Graphs;Graph-Theoretic Concepts in Computer Science;1998

5. A resource assignment problem on graphs;Algorithms and Computations;1995