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

메뉴 건너뛰기

Mathematical Methods of Operations Research

Volumn 55, Issue 1, 2002, Pages 1-10

Multiset graph partitioning

(2) Hager, William W a Krylyuk, Yaroslav a

a UNIVERSITY OF FLORIDA (United States)

Author keywords

Graph partitioning; Max cut; Min cut; Optimality conditions; Quadratic programming

Indexed keywords

ALGORITHMS; LINEAR SYSTEMS; MATRIX ALGEBRA; OPTIMIZATION; QUADRATIC PROGRAMMING; THEOREM PROVING;

GRAPH PARTITIONING;

GRAPH THEORY;

EID: 0036501340 PISSN: 14322994 EISSN: None Source Type: Journal
DOI: 10.1007/s001860200173 Document Type: Article

Times cited : (7)

References (27)

1
- 0029354779
- Recent directions in netlist partition: A survey
- (1995) Integration, the VLSI Journal , vol.19 , pp. 1-81
- Alpert, C.J.¹ Kahng, A.B.²

2
- 0001259868
- An algorithm for partitioning the nodes of a graph
- (1982) SIAM Journal on Algebraic and Discrete Mathematics , vol.3 , pp. 541-550
- Barnes, E.R.¹

3
- 0008721839
- Partitioning, spectra, and linear programming
- W. E. Pulleyblank, ed., Academic Press, New York, 1984
- (1984) Progress in Combinatorial Optimization
- Barnes, E.R.¹ Hoffman, A.J.²

4
- 0001484426
- A new heuristic for partitioning the nodes of a graph
- (1988) SlAM Journal on Discrete Mathematics , vol.1 , pp. 299-305
- Barnes, E.R.¹ Vannelli, A.² Walker, J.Q.³

5
- 0030486436
- Block pivoting and shortcut strategies for detecting copositivity
- (1996) Linear Algebra Appl. , vol.248 , pp. 161-184
- Bomze, I.M.¹

6
- 0020305083
- Necessary and sufficient conditions for quadratic minimality
- (1982) Numer. Funct. Anal. Optimization , vol.5 , pp. 127-140
- Borwein, J.M.¹

7
- 0001494416
- A heuristic for reducing fill in sparse matrix factorization
- (1993) 6-th SIAM Conf. Parallel Processing for Scientific Computing , pp. 445-452
- Bui, T.¹ Jones, C.²

8
- 0026396076
- An improved two-way partitioning algorithm with stable performance
- (1991) IEEE Transactions on Computer Aided Design , vol.10 , pp. 1502-1511
- Cheng, C.-K.¹ Wei, Y.-C.A.²

9
- 0001229486
- Une caractérisation complete des minima locaux en programmation quadratique
- (1980) Numer. Math. , vol.34 , pp. 315-332
- Contesse, L.B.¹

10
- 0015661138
- Lower bounds for the partitioning of graphs
- (1973) IBM J. of Research and Development , vol.17 , pp. 420-425
- Donath, W.E.¹ Hoffman, A.J.²

11
- 0028767591
- A computational study of graph partitioning
- (1994) Mathematical Programming , vol.66 , pp. 211-240
- Falkner, J.¹ Rendl, F.² Wolkowicz, H.³

12
- 0000966995
- Continuous characterizations of the maximum clique problem
- (1997) Mathematics of Operations Research , vol.22 , pp. 754-768
- Gibbons, L.E.¹ Hearn, D.W.² Pardalos, P.M.³ Ramana, M.V.⁴

13
- 0032204161
- Geometric mesh partitioning: Implementation and experiments
- (1998) SIAM J. Sci. Comput. , vol.19 , pp. 2091-2110
- Gilbert, J.R.¹ Miller, G.L.² Teng, S.-H.³

14
- 0001101633
- Graph partitioning and continuous quadratic programming
- (1999) SIAM J. Discrete Math. , vol.12 , pp. 500-523
- Hager, W.W.¹ Krylyuk, Y.²

15
- 21844512522
- A Cartesian parallel nested dissection algorithm
- (1995) SIAM J. Matrix Anal. Appl. , vol.16 , pp. 235-253
- Heath, M.T.¹ Raghavan, P.²

16
- 0000063845
- An improved spectral graph partitioning algorithm for mapping parallel computations
- (1995) SIAM J. Sci. Comput. , vol.16 , pp. 452-469
- Hendrickson, B.¹ Leland, R.²

17
- 0003436790
- Technical Report SAND93-1301, Sandia National Laboratories, Albuquerque, NM
- (1993) A Multilevel Algorithm for Partitioning Graphs
- Hendrickson, B.¹ Leland, R.²

18
- 0032228620
- Improving the runtime and quality of nested dissection ordering
- (1999) SIAM J. Scientific Computing , vol.20 , pp. 468-489
- Hendrickson, B.¹ Rothberg, E.²

19
- 0032131147
- A fast and high quality multilevel scheme for partitioning irregular graphs
- (1998) SIAM J. Sci. Comput. , vol.20 , pp. 359-392
- Karypis, G.¹ Kumar, V.²

20
- 84990479742
- An efficient heuristic procedure for partitioning graphs
- (1970) Bell System Technical Journal , vol.49 , pp. 291-307
- Kernighan, B.W.¹ Lin, S.²

21
- 0003828819
- John Wiley, Chichester
- (1990) Combinatorial Algorithms for Integrated Circuit Layout
- Lengauer, T.¹

22
- 0002289979
- Automatic mesh partitioning
- J. Gilbert and J. Liu eds., IMA Vol. Math. Appl., Springer-Verlag
- (1993) Sparse Matrix Computations: Graph Theory Issues and Algorithms
- Miller, G.L.¹ Teng, S.-H.² Thurston, W.³ Vavasis, S.A.⁴

23
- 0000230999
- Maxima for graphs and a new proof of a theorem of Turan
- (1965) Canad. J. Math. , vol.17 , pp. 533-540
- Motzkin, T.S.¹ Strauss, E.G.²

24
- 0000812783
- Partitioning sparse matrices with eigenvectors of graphs
- (1990) SIAM J. Matrix Anal. Appl. , vol.11 , pp. 430-452
- Pothen, A.¹ Simon, H.D.² Liou, K.-P.³

25
- 21844490712
- A projection technique for partitioning the nodes of a graph
- (1995) Ann. Oper. Res. , vol.58 , pp. 172-191
- Rendl, F.¹ Wolkowicz, H.²

26
- 0000016962
- Provably good partitioning and load balancing algorithms for parallel adaptive N-body simulation
- (1998) SIAM J. Sci. Comput. , vol.19 , pp. 635-656
- Teng, S.-H.¹

27
- 0001454293
- Semidefinite programming relaxations for the graph partitioning problem
- (1999) Discrete Appl. Math. , vol.96-97 , pp. 461-479
- Wolkowicz, H.¹ Zhao, Q.²

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