论文信息 - A Simple Linear Time Algorithm for the Domatic Partition Problem on Strongly Chordal Graphs

A Simple Linear Time Algorithm for the Domatic Partition Problem on Strongly Chordal Graphs

Abstract Let m and n be the number of edges and vertices in a graph. We use a greedy method to design an O(m+n) time algorithm to partition the vertex set of a strongly chordal graph into δ + 1 disjoint dominating sets, where δ is the minimum degree of the graph.

Sheng-Lung Peng | Maw-Shang Chang

[1] D. Rose. Triangulated graphs and the elimination process , 1970 .

[2] Martin Farber,et al. Characterizations of strongly chordal graphs , 1983, Discret. Math..

[3] Stephen T. Hedetniemi,et al. Towards a theory of domination in graphs , 1977, Networks.

[4] Kellogg S. Booth,et al. Dominating Sets in Chordal Graphs , 1982, SIAM J. Comput..

[5] C. Pandu Rangan,et al. Linear Algorithm for Domatic Number Problem on Interval Graphs , 1989, Inf. Process. Lett..

[6] Maurizio A. BONUCCELLI. Dominating sets and domatic number of circular arc graphs , 1985, Discret. Appl. Math..

[7] Robert E. Tarjan,et al. Three Partition Refinement Algorithms , 1987, SIAM J. Comput..

[8] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[9] Gerard J. Chang,et al. The Domatic Number Problem in Interval Graphs , 1990, SIAM J. Discret. Math..

[10] A. Bertossi Alan. On the domatic number of interval graphs , 1988 .

[11] Martin Farber,et al. Domination, independent domination, and duality in strongly chordal graphs , 1984, Discret. Appl. Math..