Algorithmic Aspects of Domination in Graphs-Reference-Cited by-同舟云学术

Algorithmic Aspects of Domination in Graphs

Published:1998 Issue: Volume: Page:1811-1877
ISSN:
Container-title:Handbook of Combinatorial Optimization
language:
Short-container-title:

Author:

Chang Gerard J.

Publisher

Springer US

Link

http://link.springer.com/content/pdf/10.1007/978-1-4613-0303-9_28.pdf

Reference181 articles.

1. S. Arnborg and A. Proskurowski. Linear time algorithms for NP-hard problems restricted to partial K-trees. Discrete Appl. Math, 23: 11–24, 1989.

2. K. Arvind, H. Breu, M. S. Chang, D. G. Kirkpatrick, F. Y. Lee, Y. D. Liang, K. Madhukar, C. Pandu Rangan and A. Srinivasan. Efficient algorithms in cocomparability and trapezoid graphs. Submitted, 1996.

3. K. Arvind and C. Pandu Rangan. Connected domination and Steiner set on weighted permutation graphs. Inform. Process. Lett, 41: 215–220, 1992.

4. T. Asano. Dynamic programming on intervals. Internat. J. Comput. Geom. Appl, 3: 323–330, 1993.

5. M. J. Atallah and S. R. Kosaraju. An efficient algorithm for maxdominance, with applications. Algorithmica, 4: 221–236, 1989.

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

1. Algorithmic Complexity and Bounds for Domination Subdivision Numbers of Graphs;Journal of Mathematics;2024-02-15

2. On k-Vertex-Edge Domination of Graph;Bulletin of the Malaysian Mathematical Sciences Society;2024-01-25

3. Signed roman star edge dominance of graphs;WOMEN IN PHYSICS: 7th IUPAP International Conference on Women in Physics;2023

4. Balanced Independent and Dominating Sets on Colored Interval Graphs;SOFSEM 2021: Theory and Practice of Computer Science;2021

5. On the local metric dimension of dipyramidal graph and king graph;THE THIRD INTERNATIONAL CONFERENCE ON MATHEMATICS: Education, Theory and Application;2021