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

메뉴 건너뛰기

Volumn 7, Issue 2, 1987, Pages 171-191

Graph bisection algorithms with good average case behavior

(4) Bui, T N a Chaudhuri, S a Leighton, F T b Sipser, M b

a MASSACHUSETTS INSTITUTE OF TECHNOLOGY (United States)

b MASSACHUSETTS INSTITUTE OF TECHNOLOGY (United States)

Author keywords

AMS subject classification (1980): 68C25

Indexed keywords

EID: 51249170866 PISSN: 02099683 EISSN: 14396912 Source Type: Journal
DOI: 10.1007/BF02579448 Document Type: Article

Times cited : (228)

References (20)

1
- 84935802246
- B. Baker, Approximation Algorithms for NP-complete Problems on Planar Graphs, FOCS 1983, 265–273.

2
- 84935788763
- E. R. BARNES, An Algorithm for Partitioning the Nodes of a Graph, IBM Technical Report RC8690, 1981.

3
- 84935804674
- E. R. Barnes and A. J. Hoffman, Partitioning, Spectra and Linear Programming, IBM Research Report, (unknown date).

4
- 84935807859
- S. N. Bhatt and F. T. Leighton, A Framework for Solving VLSI Graph Layout Problems, Journal of Computer and System Sciences, 28 (1984).

5
- 85012603843
- A Probabilistic Proof of an Asymptotic Formula for the Number of Labelled Regular Graphs
- (1980) European Journal of Combinatorics , vol.1 , pp. 311-316
- Bollobás, B.¹

6
- 51249183803
- The Diameter of Random Regular Graphs
- (1982) Combinatorica , vol.2 , pp. 125-134
- Bollobás, B.¹ Fernandez de la Vega, W.²

7
- 0017542479
- Min-cut Placement
- (1977) J. Design Aut. and Fault Tol. Comp. , vol.1 , pp. 343-362
- Breuer, M.A.¹

8
- 0015661138
- Lower Bounds for the Partitioning of Graphs
- (1973) IBM J. Res. Develop. , vol.17 , pp. 420-425
- Donath, W.E.¹ Hoffman, A.J.²

9
- 84935779720
- C. M. Fiduccia and R. M. Mattheyses, A Linear-Time Heuristic for Improving Network Partitions, Proceedings of the 19th Design Automation Conference, IEEE Computer Society Press. 1982, 175–181.

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

11
- 30244473678
- Some Simplified NP-complete Graph Problems
- (1976) Theoretical Computer Science , vol.1 , pp. 237-267
- Garey, M.R.¹ Johnson, D.S.² Stockmeyer, L.³

12
- 84935760386
- M. K. Goldberg and M. Burstein, Heuristic Improvement Techniques for Bisection of VLSI Networks, unpublished manuscript, 1984, Clarkson University.

13
- 84935795223
- M. K. Goldberg and R. Gardner, On the Minimal Cut Problem, in: Progress in Graph Theory, (ed: J. A. Bondy and U.S.R. Murty), Academic Press, 1984, 295–305.

14
- 84935796262
- D. S. Johnson, personal communication.

15
- 84990479742
- An Efficient Heuristic Procedure for Partitioning Graphs
- (1970) Bell System Technical Journal , vol.49 , pp. 291-307
- Kernighan, B.W.¹ Lin, S.²

16
- 84935812729
- S. Kirkpatrick, C. D. Gelatt, Jr. and M. P. Vecchi, Optimization by Simulated Annealing, IBM Research Report RC9355, April 1982, Yorktown Heights, New York.

17
- 84935817818
- R. J. Lipton and R. E. Tarjan, Applications of a Planar Separator Theorem, Proceedings of the18th Symposium on the Foundation of Computer Science, (1977), 162–170.

18
- 0018457301
- A Separator Theorem for Planar Graphs
- (1979) SIAM J. Computing , vol.36 , pp. 177-189
- Lipton, R.J.¹ Tarjan, R.E.²

19
- 84935805753
- R. M. Macgregor, On Partitioning a Graph: A Theoretical and Empirical Study, Ph. D. Thesis, University of California, Berkeley, 1978, also appeared as Technical Report UCB/ERL M78/14.

20
- 84935781883
- R. L. Rivest, The “PI” (Placement and Interconnect) System, Proceedings of the19th Annual Design Automation Conference, IEEE 1982, 475–481, Computer Society Press.

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