An O(N+M)-time algorithm for finding a minimum-weight dominating set in a permutation graph

SIAM Journal on Computing

Volumn 25, Issue 2, 1996, Pages 404-419

  Rhee, C ^a   Liang, Y D ^b   Dhall, S K ^c   Lakshmivarahan, S ^c  

^a EASTERN KENTUCKY UNIVERSITY   (United States)

^b INDIANA UNIVERSITY PURDUE UNIVERSITY FORT WAYNE   (United States)

^c University of Oklahoma   (United States)

Author keywords

Algorithm; Dominating set; Permutation graph

Indexed keywords

FUNCTIONS; GRAPH THEORY; MATHEMATICAL TRANSFORMATIONS; PROBLEM SOLVING; SET THEORY;

DOMINATING SETS; PERMUTATION GRAPH; VERTICES;

ALGORITHMS;

EID: 0030128853     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539794200383     Document Type: Article

References (12)

1. M. J. ATALLAH AND S. R. KOSARAJU, An efficient algorithm for maxdominance, with applications, Algorithmica, 4 (1989), pp. 221-236.
2. M. J. ATALLAH, G. K. MANACHER, AND J. URRUTIA, Finding a minimum independent dominating set in a permutation graph, Discrete Appl. Math., 21 (1988), pp. 177-183.
3. D. G. CORNEIL, Y. PERL, AND L. K. STEWART, A linear recognition algorithm for cographs, SIAM J. Computing, 14 (1985), pp. 926-934.
4. M. FARBER AND J. M. KEIL, Domination in permutation graphs, J. Algorithms, 6 (1985), pp. 309-321.
5. M. C. GOLUMBIC, Algorithmic Graph Theory and Perfect Graphs, Academic Press, New York, 1980.
6. Y. D. LIANG, C. RHEE, S. K. DHALL, AND S. LAKSHMIVARAHAN, A new approach for the domination problem on permutation graphs, Inform. Process. Lett., 37 (1991), pp. 219-224.
7. G. K. MANACHER AND T. A. MANKUS, Incorporating negative-weight vertices in certain vertex-search graph algorithms, Inform. Process. Lett., 42 (1992), pp. 293-294.
8. A. PNUELI, A. LEMPEL, AND S. EVEN, Transitive orientation of graphs and identification of permutation graphs, Canad. J. Math., 23 (1971), pp. 160-175.
9. C. RHEE, S. K. DHALL, and S. LAKSHMIVARAHAN, An NC algorithm for the domination in permutation graphs, in Proc. 28th Annual Allerton Conference on Communication, Control, and Computing, Monticello, IL, 1990, pp. 294-295.
10. J. SPINRAD, On comparability and permutation graphs, SIAM J. Comput., 14 (1985), pp. 658-670.
11. J. SPINRAD, A. BRANDSTADT, AND L. STEWART, Bipartite permutation graphs, Discrete Appl. Math., 18 (1987), pp. 279-292.
12. K. H. TSAI AND W. L. HSU, Fast algorithms for the dominating set problem on permutation graphs, in SIGAL'90 Algorithms, Asano et al., eds., Lecture Notes in Computer Science, Springer-Verlag, New York, 450 (1990), pp. 109-117.