SCOPUS 정보 검색 플랫폼

Journal of Graph Theory

Volumn 6, Issue 3, 1982, Pages 223-254

The bandwidth problem for graphs and matrices—a survey

(4) Chinn, P Z a Chvatalova J b Dewdney, A K c Gibbs, N E d

a HUMBOLDT STATE UNIVERSITY (United States)

b CEGEP Vanier College (Canada)

c UNIVERSITY OF WESTERN ONTARIO (Canada)

d ARIZONA STATE UNIVERSITY (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84979702392 PISSN: 03649024 EISSN: 10970118 Source Type: Journal
DOI: 10.1002/jgt.3190060302 Document Type: Article

Times cited : (237)

References (93)

1
- 0000912718
- Optimal linear ordering
- (1973) SIAM J. Appl. Math. , vol.25 , pp. 403-423
- Adolfson, D.¹ Ch Hu, T.²

2
- 84985426169
- An automatic node‐relabelling scheme for minimizing a matrix or network bandwidth
- (1976) International Journal for Numerical Methods in Engineering , vol.10 , pp. 787-797
- Akhras, G.¹ Dhatt, G.²

3
- 85007654969
- Reply by author to
- (1969) J. Amer. Inst. Aeronaut. Astronaut. , vol.7 , pp. 381-382
- Akyuz, F.A.¹ Barlow, J.² Marples, C.G.³

4
- 85007698181
- An automatic node‐relabelling scheme for bandwidth minimization of stiffness matrices
- (1968) AIAA Journal , vol.6 , pp. 728-730
- Akyuz, F.A.¹ Utku, S.²

5
- 0345143544
- An algorithm for reducing the bandwidth of a matrix of symmetrical configuration
- (1965) The Computer Journal , vol.8 , pp. 264-272
- Alway, G.G.¹ Martin, D.W.²

6
- 0008457125
- An improved method for reducing the bandwidth of sparse symmetric matrices
- North Holland, Amsterdam
- (1972) Information Processing 71 (Proc. IFIP Congress 71) , pp. 1246-1250
- Arany, I.¹ Smyth, W.F.² Szoda, L.³

7
- 85025241054
- Ritka szimmetrikus matrixok savézélesség redukciója
- (1973) Informác. Elektron. , vol.4 , pp. 273-282
- Arany, I.¹ Szoda, L.²

8
- 85007676763
- Comment on an automatic node‐relabelling scheme for bandwidth minimization of stiffness matrices
- (1969) J. Amer. Inst. Aeronaut. Astronaut. , vol.7 , pp. 380-381
- Barlow, J.¹ Marples, C.G.²

9
- 85025178665
- Numbered undirected graphs and their uses: A survey of a unifying scientific and engineering concept and its use in developing a theory of nonredundant hemometric sets relating to some ambiguities in X‐ray diffraction analysis. Ph.D. dissertation, University of Southern California, Los Angeles
- (1975)
- Bloom, G.S.¹

10
- 0017478589
- Applications of numbered undirected graphs
- (1977) Proc. IEEE , vol.65 , pp. 562-570
- Bloom, G.S.¹ Golomb, S.W.²

11
- 85025191213
- An empirical investigation of reordering and data management for finite element systems of equations. Argonne Nat. Lab. Report #8056, Argonne, IL
- (1973)
- Bolstad, J.H.¹ Leaf, G.K.² Lindeman, A.J.³ Kaper, G.H.⁴

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

13
- 51249190966
- Note on minimizing the bandwidth of sparse symmetric matrices
- (1973) Computing , vol.2 , pp. 27-30
- Cheng, K.Y.¹

14
- 85025216385
- The bandwidth of the corona and composition of two graphs
- Humboldt State University, Arcata, California
- (1980) MS, Department of Mathematics
- Chinn, P.Z.¹

15
- 85025224211
- The bandwidth and other invariants of the Möbius Ladder. Technical Report, Department of Mathematics, Humboldt State University
- (1980)
- Chinn, P.Z.¹

16
- 85025197283
- Critical bandwidth ‐ 3 trees. Technical Report, Humboldt State University
- (1980)
- Chinn, P.Z.¹

17
- 19544371641
- On the bandwidth of a graph and its complement
- G. Chartrand, Wiley, New York
- (1981) The Theory and Applications of Graphs , pp. 243-253
- Chinn, P.Z.¹ Chung, F.R.K.² Erdös, P.³ Graham, R.L.⁴

18
- 0011421833
- A remark on a problem of Harary
- (1970) Czechoslovak Math. J. , vol.20 , pp. 109-111
- Chvátal, V.¹

19
- 85025212102
- On the bandwidth problem for graphs. Ph.D. dissertation, Department of Combinatorics and Optimization, University of Waterloo
- (1980)
- Chvátalová, J.¹

20
- 0040255299
- Optimal labelling of a product of two paths
- (1975) Discrete Math. , vol.11 , pp. 249-253
- Chvátalová, J.¹

21
- 85025226045
- The bandwidth problem for graphs: a collection of recent results. Research Report #24, Department of Computer Science, UWO, London, Ontario
- (1975)
- Chvátalová, J.¹ Dewdney, A.K.² Gibbs, N.E.³ Korfhage, R.R.⁴

22
- 85025188613
- Two results on the bandwidth of graphs. 10th S. E. Conference on Combinatorics, Graph Theory and Computing 1. Utilitas Mathematica, Winnipeg
- (1979) , pp. 263-274
- Chvátalová, J.¹ Opatrný, J.²

23
- 85025183172
- The bandwidth problem and operations on graphs. To appear.
- Chvátalová, J.¹ Opatrný, J.²

24
- 0015573438
- Bandwidth reduction by automatic renumbering
- (1973) Internat. J. Numer. Methods Engr. , vol.6 , pp. 345-356
- Collins, R.J.¹

25
- 85025200366
- Automated input preparation for NASTRAN. Goddard Space Flight Center Report X‐321‐69‐237
- (1969)
- Cook, W.L.¹

26
- 84945708508
- Algorithm 508 matrix bandwidth and profile reduction
- (1976) ACM Transactions on Mathematical Software , vol.2 , pp. 375-377
- Crane, H.L.¹ Gibbs, N.E.² Poole, W.G.³ Stockmeyer, P.K.⁴

27
- 0346824994
- Bandwidth minimization of stiffness matrices
- (1971) J. Dech. Div. ASCE , vol.97 , pp. 163-167
- Crose, J.G.¹

28
- 0001803542
- Several strategies for reducing the bandwidth of matrices
- D. Rose, R. Willoughby, Plenum, New York
- (1972) Sparse Matrices and their Applications , pp. 157-166
- Cuthill, E.¹

29
- 0014612601
- Reducing the bandwidth of sparse symmetric matrices. Proc. 24th Nat. Conf. ACM
- (1969) , pp. 157-172
- Cuthill, E.¹ McKee, J.²

30
- 85025186580
- The bandwidth problem for graphs: some recent results. In 7th S. E. Conference on Combinatorics, Graph Theory and Computing. Utilitas Mathematica, Winnipeg
- (1976) , pp. 273-288
- Dewdney, A.K.¹

31
- 85025193744
- Tree topology and the NP‐completeness of tree bandwidth. Research Report #60, Department of Computer Science, UWO, London, Ontario
- (1980)
- Dewdney, A.K.¹

32
- 85025221920
- The bandwidth of the complete multipartite graph. Presented at the Toledo Symposium on Applications of Graph Theory
- (1979)
- Eitner, P.G.¹

33
- 85025224992
- The bandwidth problem for directed graphs
- (1980) Abst. Amer. Math. Soc. , vol.1 , pp. 408
- Eitner, P.G.¹

34
- 0002093384
- Efficient code for steady‐state flows in networks
- (1970) J. Hydraulics Div. Proc. ASCE , vol.96 , pp. 43-56
- Epp, R.¹ Fowler, A.G.²

35
- 85025228319
- The BANDIT computer program for the reduction of matrix bandwidth for NASTRAN. NSRDC Report 3827, Bethesda, MD
- (1972)
- Everstine, G.C.¹

36
- 0018311887
- A comparison of three resequencing algorithms for the reduction of matrix profile and wave‐front
- (1979) Internat. J. Numer. Methods in Engr. , vol.14 , pp. 837-863
- Everstine, G.C.¹

37
- 85003237219
- Recent improvements to BANDIT
- NASA TM X‐3278
- (1975) NASTRAN's User Experience , pp. 511-521
- Everstine, G.¹

38
- 84966249385
- Optimal indexing of the vertices of a graph
- (1974) Mathematics of Computation , vol.28 , pp. 825-831
- FitzGerald, C.H.¹

39
- 84972514233
- Incidence matrices and interval graphs
- (1965) Pacific Journal of Mathematics , vol.15 , pp. 835-855
- Fulkerson, D.R.¹ Gross, O.A.²

40
- 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.⁴

41
- 0003603813
- W. H. Freeman, San Franciso
- (1979) Computers and Intractibility: A Guide to the Theory of NP‐Completeness
- Garey, M.R.¹ Johnson, D.S.²

42
- 30244473678
- Some simplified NP‐complete graph problems
- (1976) Theoretical Comp. Sci. , vol.1 , pp. 237-267
- Garey, M.R.¹ Johnson, D.S.² Stockmeyer, R.L.³

43
- 85028007389
- Some simplified NP‐complete problems. Proc. 6th Annual ACM Symp. On Theory of Computing
- (1974) , pp. 47-63
- Garey, M.R.¹ Johnson, D.S.² Stockmeyer, R.L.³

44
- 85025239506
- Computer Implementation of the finite element method. Ph.D. dissertation, Tech. Report STAN‐CS‐71‐208, Computer Science Department, Stanford University, Stanford, CA
- (1971)
- George, J.A.¹

45
- 5644231721
- Algorithms for matrix partitioning and the numerical solution of finite element systems
- (1978) SIAM Journal on Numerical Analysis , vol.15 , pp. 297-327
- George, J.A.¹ Liu, J.W.H.²

46
- 0001406470
- Algorithm 509 ‐ A hybrid profile reduction algorithm
- (1976) ACM Transactions on Mathematical Software , vol.2 , pp. 378-387
- Gibbs, N.E.¹

47
- 85025222458
- The bandwidth of graphs. Ph.D. dissertation, Purdue University, Lafayette, IN
- (1969)
- Gibbs, N.E.¹

48
- 53049100655
- Tridiagonalization by permutations
- (1974) Comm. ACM , vol.20 , pp. 20-24
- Gibbs, N.E.¹ Poole, W.G.²

49
- 0016939622
- An algorithm for reducing the bandwidth and profile of a sparse matrix
- (1976) SIAM J. Numer. Anal. , vol.13 , pp. 235-251
- Gibbs, N.E.¹ Poole, W.G.² Stockmeyer, P.K.³

50
- 85025180168
- An algorithm for reducing the bandwidth and profile of a sparse matrix. ICASE
- (1974)
- Gibbs, N.E.¹ Poole, W.G.² Stockmeyer, P.K.³

51
- 0017269689
- A comparison of several bandwidth and profile reduction algorithms
- (1976) ACM Trans. Math. Software , vol.2 , pp. 322-330
- Gibbs, N.E.¹ Poole, W.G.² Stockmeyer, P.K.³

52
- 0002591135
- How to number a graph
- R. C. Read, Academic, New York
- (1972) Graph Theory and Computing , pp. 23-37
- Golomb, S.W.¹

53
- 0041469574
- On primitive graphs and optimal vertex assignments
- (1970) Annals of the New York Academy of Sciences , vol.175 , pp. 170-186
- Graham, R.L.¹

54
- 0015281973
- Algorithm for matrix bandwidth reduction
- (1972) J. Struct. Div. ASCE , vol.98 , pp. 203-214
- Grooms, H.R.¹

55
- 0003780715
- Addison‐Wesley, Reading, MA
- (1969) Graph Theory
- Harary, F.¹

56
- 0345222630
- Problem 16
- M. Fiedler, Czechoslovak Academy of Science, Prague
- (1967) Theory of graphs and its applications
- Harary, F.¹

57
- 0001394447
- Optimal assignment of numbers to vertices
- (1964) J. SIAM , vol.12 , pp. 131-135
- Harper, L.H.¹

58
- 0001173412
- Optimal numberings and isoperimetric problems on graphs
- (1966) J. Combinat. Theory , vol.1 , pp. 385-393
- Harper, L.H.¹

59
- 85025213771
- Some unsolved problems involving combinatorial algorithms. MS, Department of Computer and Information Science, University of Oregon
- (1980)
- Hedetniemi, S.T.¹

60
- 49049147118
- On cross‐bandwidth
- (1981) Discrete Math. , vol.33 , pp. 323-325
- Kahn, J.¹ Kleitman, D.J.²

61
- 0014861466
- An automatic reordering scheme for simultaneous equations derived from network systems
- (1970) International Journal for Numerical Methods in Engineering , vol.2 , pp. 523-533
- King, I.P.¹

62
- 0016872076
- Reducing bandwidth of structural stiffness matrices
- (1976) J. Structural Mech. , vol.4 , pp. 197-226
- Konishi, I.¹ Shiraish, N.² Taniguch, T.³

63
- 85025182394
- Numberings of the vertices of graphs. Computer Science Department Technical Report 5, Purdue University, Lafayette, IN
- (1966)
- Korfhage, R.R.¹

64
- 85025201759
- The bandwidth of cubic graphs. Res. Memo 70‐1
- Purdue University, Lafayette, IN
- (1970) School of Industrial Engineering
- Korfhage, R.R.¹ Gibbs, N.E.²

65
- 85025230248
- Sequencing jobs to minimize total weighted completion time subject to precedence constraints. Submitted.
- Lawler, E.L.¹

66
- 85025234806
- Relabelling algorithm to obtain a band‐matrix from a sparse one. Technical Report PFL‐3‐72, Department of Civil Engineering, University of Sherbrooke, Sherbrooke, Quebec
- (1972)
- Lemieux, P.F.¹ Brunelle, P.E.²

67
- 0006274709
- Resequencing of the structural stiffness matrix to improve computational efficiency
- (1971) Jet Propul. Lab. Quart. Tech. Rev. , vol.1 , pp. 61-70
- Levy, R.¹

68
- 85025231079
- Structural stiffness matrix wavefront resequencing program (WAVEFRONT). JPL Technical Report 32–1526, Vol. XIV
- (1972) , pp. 50-55
- Levy, R.¹

69
- 85025216949
- Implementation of the Gibbs‐Poole‐Stockmeyer algorithm and the Gibbs‐King algorithm (algorithms 508 and 509)
- ACM Trans. Math. Software.
- Lewis, J.G.¹

70
- 85025196067
- Bandwidth reduction for simultaneous equations in matrix analysis. Babcock and Wilcox Co., Report TP‐535, Lynchburg, VA
- (1974)
- Lin, C.C.¹

71
- 85025181815
- On reducing the profile of sparse symmetric matrices. Ph.D. dissertation, Department of Computer Science, Faculty of Mathematics, University of Waterloo, Waterloo, Ontario
- (1975)
- Liu, J.W.¹

72
- 0016940739
- Comparative analysis of the Cuthill‐McKee and the reverse Cuthill‐McKee ordering algorithms for sparse matrices
- (1975) SIAM J. Num. Anal. , vol.12 , pp. 198-213
- Liu, J.W.H.¹ Sherman, A.H.²

73
- 34848911426
- The analysis of large structural systems
- (1960) The Computer Journal , vol.3 , pp. 34-39
- Livesley, R.K.¹

74
- 85025224432
- Discussion of algorithm for matrix bandwidth reduction by
- (1972) J. Structural Div. ASCE , vol.98 , pp. 2820-2821
- Nelson, M.F.¹ Hidalgo, J.² Grooms, H.R.³

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

76
- 85025219833
- NASA Technical Memo. NASA TM X‐2660
- (1972) Relabelling of finite‐element meshes using a random process
- Roberts, E.¹

77
- 0016471260
- Node numbering optimization in structural analysis
- (1975) J. Struct. Div. ASCE , vol.101 , pp. 361-376
- Rodrigues, J.S.N.¹

78
- 0012830821
- On certain valuations of the vertices of a graph. Theory of Graphs, International Symposium Rome. Gordon and Breach
- (1967) , pp. 349-355
- Rosa, A.¹

79
- 0002892530
- A graph‐theoretic study of the numerical solution of sparse positive definite systems of linear equations
- R. C. Read, Academic, New York
- (1972) Graph Theory and Computing , pp. 23-37
- Rose, D.J.¹

80
- 84985337738
- Matrix bandwidth minimization
- Brandon Systems, Princeton, NJ
- (1968) Proc. 23rd Natl. Conf. ACM , pp. 585-595
- Rosen, R.¹

81
- 0038490433
- Dynamic programming algorithms for recognizing small‐bandwidth graphs in polynomial time
- (1980) SIAM Journal on Algebraic Discrete Methods , vol.1 , pp. 363-369
- Saxe, J.B.¹

82
- 0042212667
- The factorial representation of balanced, labelled graphs
- (1976) Discrete Math. , vol.15 , pp. 379-388
- Sheppard, D.A.¹

83
- 84918421099
- Another algorithm for reducing bandwidth and profile of a sparse matrix
- AFIPS Press, Montvale, New Jersey
- (1976) Proc. AFIPS 1976 NCC , pp. 987-994
- Smith, W.F.¹ Arany, I.²

84
- 51249188888
- Reducing the profile of sparse symmetric matrices
- (1976) Bul. Géodésique , vol.50 , pp. 341-352
- Snay, R.A.¹

85
- 85023287774
- The bandwidth problem for ordered caterpillars
- Washington State University
- (1980) Computer Science Department Report CS‐80‐065
- Syslo, M.M.¹ Zak, J.²

86
- 0346194330
- Row column permutation of sparse matrices
- (1967) The Computer Journal , vol.10 , pp. 300-305
- Tewarson, R.P.¹

87
- 85025179286
- On the bandwidth ordering and isoperimetric problems on graphs that are products of paths or even cycles. To appear.
- Wang, D.L.¹ Wang, P.²

88
- 0042677415
- Discrete isoperimetric problems
- (1977) SIAM Journal on Applied Mathematics , vol.32 , pp. 860-870
- Wang, D.L.¹ Wang, P.²

89
- 85025202842
- Bandwidth minimization, reducibility, decomposition, and triangularization of sparse matrices. Ph.D. dissertation, Department of Computer and Information Science, Ohio State University, Columbus, OH
- (1973)
- Wang, P.T.R.¹

90
- 85025201904
- Bandwidth reduction of sparse matrices by row and column permutations
- (1975) SIAM Rev. , vol.17 , pp. 391
- Wang, P.T.R.¹ Kerr, D.S.² White, L.J.³

91
- 85025204454
- R. A. Willoughby, Ed., IBM Sparse matrix proceedings. IBM Report RAI, No. 11707
- (1969)

92
- 85025180241
- The bandwidth minimization problem for trees. Master's thesis, Institute of Computer Science, University of Wroclaw
- (1980)
- Zak, J.W.¹

93
- 0003453213
- McGraw‐Hill, London
- (1971) The Finite Element Method in Engineering Science
- Zienkiewicz, O.C.¹

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