A computational study of graph partitioning-Reference-Cited by-同舟云学术

A computational study of graph partitioning

Published:1994-08 Issue:1-3 Volume:66 Page:211-239
ISSN:0025-5610
Container-title:Mathematical Programming
language:en
Short-container-title:Mathematical Programming

Author:

Falkner Julie,Rendl Franz,Wolkowicz Henry

Publisher

Springer Science and Business Media LLC

Subject

General Mathematics,Software

Link

http://link.springer.com/content/pdf/10.1007/BF01581147.pdf

Reference28 articles.

1. N. Alon and V.D. Milman, “λ 1, isoperimetric inequalities for graphs and superconcentrators,”JCT 38 (1985) 73–88.

2. S. Areibi and A. Vannelli, Personal communication, technical report, University of Waterloo, Waterloo, Ontario, Canada, 1993.

3. S.T. Barnard and H.D. Simon, “A fast multilevel implementation of recursive spectral bisection for partitioning unstructured problems,” technical report RNR-092-033, NASA Ames Research Center, Moffett Field, CA 94035, November 1992 (to appear inConcurrency: Practice and Experience).

4. E.R. Barnes, “An algorithm for partitioning the nodes of a graph,”SIAM Journal on Algebraic and Discrete Mathematics 3 (1982) 541–550.

5. E.R. Barnes, A. Vannelli and J.Q. Walker, “A new heuristic for partitioning the nodes of a graph,”SIAM Journal on Discrete Mathematics 1 (1988) 299–305.

Cited by 36 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Spectral bounds for graph partitioning with prescribed partition sizes;Discrete Applied Mathematics;2019-09

2. The min-cut and vertex separator problem;Computational Optimization and Applications;2017-09-18

3. Operation of shunting yards: train-to-yard assignment problem;Journal of Business Economics;2016-06-01

4. Eigenvalue, quadratic programming, and semidefinite programming relaxations for a cut minimization problem;Computational Optimization and Applications;2015-08-21

5. Semidefinite programming and eigenvalue bounds for the graph partition problem;Mathematical Programming;2014-09-14