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

메뉴 건너뛰기

Mathematical Systems Theory

Volumn 24, Issue 1, 1991, Pages 169-177

Bandwidth Minimization: An approximation algorithm for caterpillars

(3) Haralambides, J a Makedon, F a Monien, B b

a UNIVERSITY OF TEXAS AT DALLAS (United States)

b UNIVERSITY OF PADERBORN (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0012361172 PISSN: 00255661 EISSN: 14330490 Source Type: Journal
DOI: 10.1007/BF02090396 Document Type: Article

Times cited : (31)

References (18)

1
- 0016881473
- The NP-completeness of the bandwidth minimization problem
- (1976) Computing , vol.16 , pp. 263-270
- Papadimitriou, C.H.¹

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

3
- 0000416130
- Complexity results for bandwidth minimization
- (1978) SIAM Journal on Applied Mathematics , vol.34 , pp. 477-495
- Garey, M.R.¹ Graham, R.L.² Johnson, D.S.³ Knuth, D.E.⁴

4
- 84935984284
- J. B. Saxe, Dynamic programming algorithms for recognizing small bandwidth graphs in polynomial time, SIAM J. Algebraic Discrete Methods (1980).

5
- 0037814216
- Improved dynamic programming algorithms for bandwidth minimization and the min-cut linear arrangement problems
- (1984) J. Algorithms , vol.5 , pp. 531-546
- Gurari, E.M.¹ Sudborough, I.H.²

6
- 0011517609
- The Bandwidth-Minimization Problem for Caterpillars with Hairlength 3 is NP Complete
- (1986) SIAM Journal on Algebraic Discrete Methods , vol.7 , pp. 505-512
- Monien, B.¹

7
- 84935963952
- S. F. Assman, G. W. Peck, M. M. Syslo, and J. Zak, The bandwidth of caterpillars with hairs of length 1 and 2, SIAM J. Algebraic Discrete Methods (1981), 387–391.

8
- 84935977143
- J. Turner, Bandwidth and Probabilistic Complexity, Thesis, Northwestern University, Evanston, IL.

9
- 0014612601
- Reducing the bandwidth of sparse symmetric matrices
- (1969) ACM National Conference Proc. , vol.24 , pp. 137-172
- Cuthill, E.¹ McKee, J.²

10
- 51249187962
- Minimizing the bandwidth of sparse symmetric matrices
- (1973) Computing , vol.11 , pp. 103-110
- Cheng, K.Y.¹

11
- 84979702392
- The bandwidth problem for graphs and matrices—a survey
- (1982) Journal of Graph Theory , vol.6 , pp. 223-254
- Chinn, P.Z.¹ Chvatalova, J.² Dewdney, A.K.³ Gibbs, N.E.⁴

12
- 84935975268
- I. Arany, L. Szoda, and W. F. Smith, An improved method for reducing the bandwidth of sparse symmetric matrices, Proc. 1971 IFIP Congress, pp. 1246–1250.

13
- 50249110337
- Some problems and results in labeling of graphs
- G., Chartrand, Wiley, New York
- (1981) The Theory and Applications of Graphs , pp. 255-263
- Chung, F.R.K.¹

14
- 0016940739
- Comparative analysis of the Cuthill-McKee ordering algorithms for sparse matrices
- (1976) SIAM Journal on Numerical Analysis , vol.13 , pp. 198-213
- Lin, W.¹ Sherman, A.B.²

15
- 0007119909
- Bandwidth constraints on problems complete for polynomial time
- (1983) Theoret. Comput. Sci. , vol.26 , pp. 25-52
- Sudborough, I.H.¹

16
- 84935927102
- F. S. Makedon, Graph Layout Problems and Their Complexity, Ph.D. Thesis, August 1982, Electrical Engineering and Computer Science Department, Northwestern University, Evanston, IL.

17
- 84935804391
- Graph layout problems
- H., Maurer, Bibliographisches Institut, Zurich
- (1984) Surveys in Computer Science , pp. 145-192
- Makedon, F.S.¹ Sudborough, I.H.²

18
- 84935987464
- M. M. Syslo and J. Zak, The Bandwidth Problem for Ordered Caterpillars, Report CS-80-065, Computer Science Department, Washington State University, 1980.

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