메뉴 건너뛰기
Discrete Applied Mathematics
Volumn 102, Issue 3, 2000, Pages 159-173
An optimal algorithm for finding the minimum cardinality dominating set on permutation graphs
Author keywords

[No Author keywords available]
Indexed keywords

EID: 0346673755     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(98)00145-0     Document Type: Article
Times cited : (32)
References (14)
  • 1
    • 0026840223 scopus 로고
    • Connected domination and Steiner set on weighted permutation graphs
    • Arvind K., Pandu Rangan C. Connected domination and Steiner set on weighted permutation graphs. Inform. Process. Lett. 41:1992;215-220.
    • (1992) Inform. Process. Lett. , vol.41 , pp. 215-220
    • Arvind, K.1    Pandu Rangan, C.2
  • 2
    • 0024776688 scopus 로고
    • An efficient algorithm for maxdominance, with applications
    • Atallah M.J., Kosaraju S.R. An efficient algorithm for maxdominance, with applications. Algorithmica. 4:1989;221-236.
    • (1989) Algorithmica , vol.4 , pp. 221-236
    • Atallah, M.J.1    Kosaraju, S.R.2
  • 3
    • 0023435077 scopus 로고
    • On domination problems for permutation and other graphs
    • Brandstädt A., Kratsch D. On domination problems for permutation and other graphs. Theoret. Comput. Sci. 54:1987;181-198.
    • (1987) Theoret. Comput. Sci. , vol.54 , pp. 181-198
    • Brandstädt, A.1    Kratsch, D.2
  • 4
    • 38249017556 scopus 로고
    • Permutation graphs: Connected domination and Steiner trees
    • Colbourn C.J., Stewart L.K. Permutation graphs: Connected domination and Steiner trees. Discrete Math. 86:1990;179-189.
    • (1990) Discrete Math. , vol.86 , pp. 179-189
    • Colbourn, C.J.1    Stewart, L.K.2
  • 5
    • 38249016306 scopus 로고
    • Dominating sets in perfect graphs
    • Corneil D.G., Stewart L.K. Dominating sets in perfect graphs. Discrete Math. 86:1990;145-164.
    • (1990) Discrete Math. , vol.86 , pp. 145-164
    • Corneil, D.G.1    Stewart, L.K.2
  • 6
    • 0006764920 scopus 로고
    • Domination in permutation graphs
    • Farber M., Keil J.M. Domination in permutation graphs. J. Algorithms. 6:1985;309-321.
    • (1985) J. Algorithms , vol.6 , pp. 309-321
    • Farber, M.1    Keil, J.M.2
  • 9
    • 38149146923 scopus 로고
    • Some efficient algorithms for permutation graphs
    • Ibarra O.H., Zheng Q. Some efficient algorithms for permutation graphs. J. Algorithms. 16:1994;453-469.
    • (1994) J. Algorithms , vol.16 , pp. 453-469
    • Ibarra, O.H.1    Zheng, Q.2
  • 10
    • 0345994779 scopus 로고
    • Connected domination and Steiner trees in permutation graphs
    • In:
    • Y.D. Liang, Connected domination and Steiner trees in permutation graphs. In: ICS'94: 1994 Internat. Comput. Symp., 1994, pp. 13-18.
    • (1994) ICS'94: 1994 Internat. Comput. Symp. , pp. 13-18
    • Liang, Y.D.1
  • 12
    • 0030128853 scopus 로고    scopus 로고
    • An O(m+n) algorithm for finding minimum weight dominating set in permutation graphs
    • Rhee C., Liang Y.D., Dhall S.K., Lakshmivarahan S. An. O(m+n) algorithm for finding minimum weight dominating set in permutation graphs SIAM J. Comput. 25(2):1996;404-419.
    • (1996) SIAM J. Comput. , vol.25 , Issue.2 , pp. 404-419
    • Rhee, C.1    Liang, Y.D.2    Dhall, S.K.3    Lakshmivarahan, S.4
  • 13
    • 0022104841 scopus 로고
    • On comparability and permutation graphs
    • Spinrad J. On comparability and permutation graphs. SIAM J. Comput. 14(3):1985;658-670.
    • (1985) SIAM J. Comput. , vol.14 , Issue.3 , pp. 658-670
    • Spinrad, J.1
  • 14
    • 0027610892 scopus 로고
    • Fast algorithms for the dominating set problem on permutation graphs
    • Tsai K.H., Hsu W.L. Fast algorithms for the dominating set problem on permutation graphs. Algorithmica. 9:1993;601-614.
    • (1993) Algorithmica , vol.9 , pp. 601-614
    • Tsai, K.H.1    Hsu, W.L.2

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.