SCOPUS 정보 검색 플랫폼 - 논문 보기

메뉴 건너뛰기

Discrete Applied Mathematics

Volumn 80, Issue 2-3, 1997, Pages 135-148

Weighted domination of cocomparability graphs

(1) Chang, Maw Shang a

a NATIONAL CHUNG CHENG UNIVERSITY (Taiwan)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0037536891 PISSN: 0166218X EISSN: None Source Type: Journal
DOI: 10.1016/s0166-218x(97)80001-7 Document Type: Article

Times cited : (27)

References (21)

1
- 0012544360
- Efficient dominating sets in graphs
- R.D. Ringeisen, F.S. Roberts, (Eds.), SIAM, Philadelphia
- D.W. Bange, A.E. Barkauskas, P.T. Slater, Efficient dominating sets in graphs, in R.D. Ringeisen, F.S. Roberts, (Eds.), Applications of Discrete Mathematics, SIAM, Philadelphia, 1988, pp. 189-199.
- (1988) Applications of Discrete Mathematics , pp. 189-199
- Bange, D.W.¹ Barkauskas, A.E.² Slater, P.T.³

2
- 0001058806
- Perfect codes in graphs
- N. Biggs, Perfect codes in graphs, J. Combin. Theory, Ser. B 15 (1973) 289-296.
- (1973) J. Combin. Theory, Ser. B , vol.15 , pp. 289-296
- Biggs, N.¹

3
- 30244481236
- Private communication
- G.J. Chang, Private communication.
- Chang, G.J.¹

4
- 0012486130
- Weighted independent perfect domination on cocomparability graphs
- G.J. Chang, C. Pandu Rangan, S.R. Coorg, Weighted independent perfect domination on cocomparability graphs, Discrete Appl. Math. 63 (1995) 215-222.
- (1995) Discrete Appl. Math. , vol.63 , pp. 215-222
- Chang, G.J.¹ Pandu Rangan, C.² Coorg, S.R.³

5
- 0027701357
- Polynomial algorithms for the weighted perfect domination problems in chordal graphs and split graphs
- M.S. Chang, Y.C. Liu, Polynomial algorithms for the weighted perfect domination problems in chordal graphs and split graphs, Inform. Process. Lett. 48 (1993) 205-210.
- (1993) Inform. Process. Lett. , vol.48 , pp. 205-210
- Chang, M.S.¹ Liu, Y.C.²

6
- 38249016306
- Dominating sets in perfect graphs
- D.G. Corneil, L. Stewart, Dominating sets in perfect graphs, Discrete Math. 86 (1990) 145-164.
- (1990) Discrete Math. , vol.86 , pp. 145-164
- Corneil, D.G.¹ Stewart, L.²

7
- 0041406549
- Finding hamiltonian paths in cocomparability graphs using bump number algorithm
- P. Damaschke, J.S. Deogun, D. Kratsch, G. Steiner, Finding Hamiltonian paths in cocomparability graphs using bump number algorithm, Order 8 (1992) 383-391.
- (1992) Order , vol.8 , pp. 383-391
- Damaschke, P.¹ Deogun, J.S.² Kratsch, D.³ Steiner, G.⁴

8
- 38249010520
- Hamiltonian cycle is polynomial on cocomparability graphs
- J.S. Deogun, G. Steiner, Hamiltonian cycle is polynomial on cocomparability graphs, Discrete Appl. Math. 39 (1992) 165-172.
- (1992) Discrete Appl. Math. , vol.39 , pp. 165-172
- Deogun, J.S.¹ Steiner, G.²

9
- 0028452825
- Polynomial algorithm for hamiltonian cycle in cocomparability graphs
- J.S. Deogun, G. Steiner, Polynomial algorithm for Hamiltonian cycle in cocomparability graphs, SIAM J. Comput. 23 (1994) 520-552.
- (1994) SIAM J. Comput. , vol.23 , pp. 520-552
- Deogun, J.S.¹ Steiner, G.²

10
- 0020179883
- Independent domination in chordal graphs
- M. Farber, Independent domination in chordal graphs, Oper. Res. Lett. 4 (1982) 134-138.
- (1982) Oper. Res. Lett. , vol.4 , pp. 134-138
- Farber, M.¹

11
- 0012232854
- Perfect domination
- M.R. Fellows, M.N. Hoover, Perfect domination, Australasian J. Combinatorics 3 (1991) 141-150.
- (1991) Australasian J. Combinatorics , vol.3 , pp. 141-150
- Fellows, M.R.¹ Hoover, M.N.²

12
- 0003603813
- W.H. Freeman, New York
- M.R. Garey, D.S. Johnson, Computers and Intractability: A guide to the Theory of NP-completeness, W.H. Freeman, New York, 1979.
- (1979) Computers and Intractability: A Guide to the Theory of NP-Completeness
- Garey, M.R.¹ Johnson, D.S.²

13
- 38249041657
- Perfect codes over graphs
- J. Kratochvil, Perfect codes over graphs, J. Combin. Theory Ser. B 40 (1986) 224-228.
- (1986) J. Combin. Theory Ser. B , vol.40 , pp. 224-228
- Kratochvil, J.¹

14
- 0000148891
- Domination on cocomparability graphs
- D. Kratsch, L. Stewart, Domination on cocomparability graphs, SIAM J. Discrete Math. 6 (1993) 400-417.
- (1993) SIAM J. Discrete Math. , vol.6 , pp. 400-417
- Kratsch, D.¹ Stewart, L.²

15
- 0001663014
- Perfect dominating sets
- M. Livingston, Q.F. Stout, Perfect dominating sets, Congressus Numerantium 79 (1990) 187-203.
- (1990) Congressus Numerantium , vol.79 , pp. 187-203
- Livingston, M.¹ Stout, Q.F.²

16
- 0028257901
- Linear time modular decomposition and efficient transitive orientation of comparability graphs
- R.M. McConnell, J.P. Spinrad, Linear time modular decomposition and efficient transitive orientation of comparability graphs, Proc. 5th Annual ACM-SIAM Symposium on discrete algorithms (1994) 536-545.
- (1994) Proc. 5th Annual ACM-SIAM Symposium on Discrete Algorithms , pp. 536-545
- McConnell, R.M.¹ Spinrad, J.P.²

17
- 0026895456
- Incorporating negative-weight vertices in certain vertex-search graph algorithms
- G.K. Manacher, T.A. Mankus, Incorporating negative-weight vertices in certain vertex-search graph algorithms, Inform. Process. Lett. 42 (1992) 293-294.
- (1992) Inform. Process. Lett. , vol.42 , pp. 293-294
- Manacher, G.K.¹ Mankus, T.A.²

18
- 0004112038
- Addison-Wesley, Massachusetts
- R. Sedgewick, Algorithm, Addison-Wesley, Massachusetts, 1983.
- (1983) Algorithm
- Sedgewick, R.¹

19
- 0022104841
- On comparability and permutation graphs
- J. Spinard, On comparability and permutation graphs, SIAM J. Comput. 14 (1985) 658-670.
- (1985) SIAM J. Comput. , vol.14 , pp. 658-670
- Spinard, J.¹

20
- 0025493965
- The weighted perfect domination problem
- C.C. Yen, R.C.T. Lee, The weighted perfect domination problem, Inform. Process. Lett. 35 (1990) 295-299.
- (1990) Inform. Process. Lett. , vol.35 , pp. 295-299
- Yen, C.C.¹ Lee, R.C.T.²

21
- 0012487270
- The weighted perfect domination problem and its variants
- C.C. Yen, R.C.T. Lee, The weighted perfect domination problem and its variants, Discrete Appl. Math. 66 (1996) 147-160.
- (1996) Discrete Appl. Math. , vol.66 , pp. 147-160
- Yen, C.C.¹ Lee, R.C.T.²

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