The Parallel Algorithms for Determining Edge-packing and Efficient Edge Dominating Sets in Interval Graphs
暂无分享,去创建一个
[1] Richard C. T. Lee,et al. The Weighted Perfect Domination Problem , 1990, Inf. Process. Lett..
[2] Stephen T. Hedetniemi,et al. Towards a theory of domination in graphs , 1977, Networks.
[3] N. Biggs. Perfect codes in graphs , 1973 .
[4] Peter J. Slater,et al. A Recurrence Template for Several Parameters in Series-parallel Graphs , 1994, Discret. Appl. Math..
[5] Béla Bollobás,et al. Graph-theoretic parameters concerning domination, independence, and irredundance , 1979, J. Graph Theory.
[6] C. P. Rangan,et al. A Unified Approach to Domination Problems on Interval Graphs , 1988, Inf. Process. Lett..
[7] M. Golumbic. Algorithmic graph theory and perfect graphs , 1980 .
[8] O. Ore. Theory of Graphs , 1962 .
[9] Peter J. Slater,et al. Efficient Edge Domination Problems in Graphs , 1993, Inf. Process. Lett..
[10] Stephen T. Hedetniemi,et al. Total domination in graphs , 1980, Networks.
[11] M. Livingston,et al. Distributing resources in hypercube computers , 1988, C3P.
[12] Martin Farber,et al. Steiner trees, connected domination and strongly chordal graphs , 1985, Networks.
[13] Claude Berge,et al. Graphs and Hypergraphs , 2021, Clustering.
[14] Lin Chen,et al. Optimal Parallel Time Bounds for the Maximum Clique Problem on Intervals , 1992, Inf. Process. Lett..
[15] Stephan Olariu,et al. Optimal Parallel Algorithms for Problems Modeled by a Family of Intervals , 1992, IEEE Trans. Parallel Distributed Syst..
[16] Tadao Takaoka,et al. A New Upper Bound on the Complexity of the All Pairs Shortest Path Problem , 1991, Inf. Process. Lett..