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

메뉴 건너뛰기

Discrete Applied Mathematics

Volumn 87, Issue 1-3, 1998, Pages 245-253

Weighted connected domination and Steiner trees in distance-hereditary graphs

(2) Yeh, Hong Gwa a Chang, Gerard J a

a NATIONAL CHIAO TUNG UNIVERSITY (Taiwan)

Author keywords

Algorithm; Cograph; Connected domination; Distance hereditary graph; Steiner tree

Indexed keywords

EID: 0000892723 PISSN: 0166218X EISSN: None Source Type: Journal
DOI: 10.1016/s0166-218x(98)00060-2 Document Type: Article

Times cited : (23)

References (30)

1
- 0002003951
- Linear time algorithms for NP-hard problems restricted to partial k-trees
- S. Arnborg, A. Proskurowski, Linear time algorithms for NP-hard problems restricted to partial k-trees, Discrete Appl. Math. 23 (1989) 11-24.
- (1989) Discrete Appl. Math. , vol.23 , pp. 11-24
- Arnborg, S.¹ Proskurowski, A.²

2
- 0003303557
- Distance-hereditary graphs
- H.J. Bandelt, H.M. Mulder, Distance-hereditary graphs, J. Combin. Theory, Series B 41 (1986) 182-208.
- (1986) J. Combin. Theory, Series B , vol.41 , pp. 182-208
- Bandelt, H.J.¹ Mulder, H.M.²

3
- 0039370458
- preprint
- A. Brandstädt, F.F. Dragan, A linear-time algorithm for connected r-domination and Steiner tree on distance-hereditary graphs, preprint, 1994.
- (1994) A Linear-time Algorithm for Connected r-domination and Steiner Tree on Distance-hereditary Graphs
- Brandstädt, A.¹ Dragan, F.F.²

4
- 0042118060
- Parity graphs
- M. Burlet, J.P. Uhry, Parity graphs, Annals of Discrete Math. 21 (1984) 253-277.
- (1984) Annals of Discrete Math. , vol.21 , pp. 253-277
- Burlet, M.¹ Uhry, J.P.²

5
- 38249028983
- Labeling algorithms for domination problems on sun-free chordal graphs
- G.J. Chang, Labeling algorithms for domination problems on sun-free chordal graphs, Discrete Appl. Math. 22 (1989) 21-34.
- (1989) Discrete Appl. Math. , vol.22 , pp. 21-34
- Chang, G.J.¹

6
- 0012486130
- Weighted independent perfect domination on cocomparability graphs
- G.J. Chang, C. Pandu Rangan, Satyan 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.³

7
- 38249017556
- Permutation graphs: Connected domination and Steiner trees
- C.J. Colbourn, L.K. Stewart, Permutation graphs: connected domination and Steiner trees, Discrete Math. 86 (1990) 145-164.
- (1990) Discrete Math. , vol.86 , pp. 145-164
- Colbourn, C.J.¹ Stewart, L.K.²

8
- 0019590904
- Complement reducible graphs
- D.G. Corneil, H. Lerchs, L. Stewart, Complement reducible graphs, Discrete Appl. Math. 3 (1981) 163-174.
- (1981) Discrete Appl. Math. , vol.3 , pp. 163-174
- Corneil, D.G.¹ Lerchs, H.² Stewart, L.³

9
- 0021483662
- Clustering and domination in perfect graphs
- D.G. Corneil, Y. Perl, Clustering and domination in perfect graphs, Discrete Appl. Math. 9 (1984) 27-39.
- (1984) Discrete Appl. Math. , vol.9 , pp. 27-39
- Corneil, D.G.¹ Perl, Y.²

10
- 0022162058
- A linear recognition algorithm for cographs
- D.G. Corneil, Y. Perl, L.K. Stewart, A linear recognition algorithm for cographs, SIAM J. Comput. 14 (1985) 926-934.
- (1985) SIAM J. Comput. , vol.14 , pp. 926-934
- Corneil, D.G.¹ Perl, Y.² Stewart, L.K.³

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

12
- 0022129352
- The traveling salesman problem on a graph and some related integer polyhedra
- G. Cornuejols, J, Fonlupt, D. Naddef, The traveling salesman problem on a graph and some related integer polyhedra, Math. Programming 33 (1985) 1-27.
- (1985) Math. Programming , vol.33 , pp. 1-27
- Cornuejols, G.¹ Fonlupt, J.² Naddef, D.³

13
- 0024019980
- Distance-hereditary graphs, Steiner trees, and connected domination
- A. D'Atri, M. Moscarini, Distance-hereditary graphs, Steiner trees, and connected domination, SIAM J. Comput. 17 (1988) 521-538.
- (1988) SIAM J. Comput. , vol.17 , pp. 521-538
- D'Atri, A.¹ Moscarini, M.²

14
- 84896748309
- The Steiner tree problem and homogeneous sets
- Springer, Berlin
- A. D'Atri, M. Moscarini, A. Sassano, The Steiner tree problem and homogeneous sets, Lecture Notes in Computer Science, vol. 324, Springer, Berlin, 1988, pp. 249-261.
- (1988) Lecture Notes in Computer Science , vol.324 , pp. 249-261
- D'Atri, A.¹ Moscarini, M.² Sassano, A.³

15
- 0041103801
- Steiner distance-hereditary graphs
- D.P. Day, O.R. Oellermann, H.C. Swart, Steiner distance-hereditary graphs, SIAM J. Discrete Math. 7 (1994) 437-442.
- (1994) SIAM J. Discrete Math. , vol.7 , pp. 437-442
- Day, D.P.¹ Oellermann, O.R.² Swart, H.C.³

16
- 0000226747
- Distance-hereditary graphs and multidestination message-routing in multicomputers
- A.-H. Esfahanian, O.R. Oellermann, Distance-hereditary graphs and multidestination message-routing in multicomputers, JCMCC 13 (1993) 213-222.
- (1993) JCMCC , vol.13 , pp. 213-222
- Esfahanian, A.-H.¹ Oellermann, O.R.²

17
- 0021376407
- Domination, independent domination and duality in strongly chordal graphs
- M. Farber, Domination, independent domination and duality in strongly chordal graphs, Discrete Appl. Math. 7 (1984) 115-130.
- (1984) Discrete Appl. Math. , vol.7 , pp. 115-130
- Farber, M.¹

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

19
- 0002740574
- Completely separable graphs
- P.H. Hammer, F. Maffray, Completely separable graphs, Discrete Appl. Math. 27 (1990) 85-99.
- (1990) Discrete Appl. Math. , vol.27 , pp. 85-99
- Hammer, P.H.¹ Maffray, F.²

20
- 0000681580
- A characterization of distance-hereditary graphs
- E. Howorka, A characterization of distance-hereditary graphs, Quart. J. Math. Oxford Ser. 2, 28 (1977) 417-420.
- (1977) Quart. J. Math. Oxford Ser. 2 , vol.28 , pp. 417-420
- Howorka, E.¹

21
- 0003689279
- North-Holland, Amsterdam
- F.K. Hwang, D.S. Richards, P. Winter, The Steiner Tree Problem, North-Holland, Amsterdam, 1992.
- (1992) The Steiner Tree Problem
- Hwang, F.K.¹ Richards, D.S.² Winter, P.³

22
- 0342800860
- The NP-completeness column: An ongoing guide
- D.S. Johnson, The NP-completeness column: an ongoing guide, J. Algorithms 6 (1985) 434-451.
- (1985) J. Algorithms , vol.6 , pp. 434-451
- Johnson, D.S.¹

23
- 0013517227
- Technical Report 430, Clemson University
- R. Laskar, J. Pfaff, Domination and irredundance in split graphs, Technical Report 430, Clemson University, 1983.
- (1983) Domination and Irredundance in Split Graphs
- Laskar, R.¹ Pfaff, J.²

24
- 0023598723
- The NP-completeness of Steiner tree and dominating set for chordal bipartite graphs
- H. Müller, A. Brandstädt, The NP-completeness of Steiner tree and dominating set for chordal bipartite graphs, Theoret. Comput. Sci. 53 (1987) 257-265.
- (1987) Theoret. Comput. Sci. , vol.53 , pp. 257-265
- Müller, H.¹ Brandstädt, A.²

25
- 0043015760
- Technical Report 428, Clemson University
- J. Pfaff, R. Laskar, S.T. Hedetniemi, NP-completeness of total and connected domination and irredundance for bipartite graphs, Technical Report 428, Clemson University, 1983.
- (1983) NP-completeness of Total and Connected Domination and Irredundance for Bipartite Graphs
- Pfaff, J.¹ Laskar, R.² Hedetniemi, S.T.³

26
- 0042514738
- A polynomial algorithm for a class of Steiner tree problems on graphs
- Georgia Institute of Technology
- R.L. Rardin, R.G. Parker, M.B. Richey, A polynomial algorithm for a class of Steiner tree problems on graphs, ISE Report J-82-5, Georgia Institute of Technology, 1982.
- (1982) ISE Report J-82-5
- Rardin, R.L.¹ Parker, R.G.² Richey, M.B.³

27
- 84986958933
- The node-weighted Steiner tree problem
- A. Segev, The node-weighted Steiner tree problem, Networks 17 (1987) 1-17.
- (1987) Networks , vol.17 , pp. 1-17
- Segev, A.¹

28
- 0016974390
- R-Domination in graphs
- P.J. Slater, R-Domination in graphs, J. Assoc. Comp. Mach. 23 (1976) 446-450.
- (1976) J. Assoc. Comp. Mach. , vol.23 , pp. 446-450
- Slater, P.J.¹

29
- 0020767156
- Steiner tree, partial 2-trees, and minimum IFI networks
- J.A. Wald, C.J. Colbourn, Steiner tree, partial 2-trees, and minimum IFI networks, Networks 13 (1983) 159-167.
- (1983) Networks , vol.13 , pp. 159-167
- Wald, J.A.¹ Colbourn, C.J.²

30
- 0022031747
- Steiner trees, connected domination and strongly chordal graphs
- K. White, M. Farber, W.R. Pulleyblank, Steiner trees, connected domination and strongly chordal graphs, Networks 15 (1985) 109-124.
- (1985) Networks , vol.15 , pp. 109-124
- White, K.¹ Farber, M.² Pulleyblank, W.R.³

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