Vertex ordering and partitioning problems for random spatial graphs

[1]  R. Diekmann,et al.  Using helpful sets to improve graph bisections , 1994, Interconnection Networks and Mapping and Scheduling Parallel Computations.

[2]  J. Beardwood,et al.  The shortest path through many points , 1959, Mathematical Proceedings of the Cambridge Philosophical Society.

[3]  M. L. Wolbarsht,et al.  NATO Advanced Study Institute. , 1986, IEEE transactions on medical imaging.

[4]  David S. Johnson,et al.  Some Simplified NP-Complete Graph Problems , 1976, Theor. Comput. Sci..

[5]  Frank Thomson Leighton,et al.  Graph bisection algorithms with good average case behavior , 1984, Comb..

[6]  M. Penrose,et al.  Large deviations for discrete and continuous percolation , 1996, Advances in Applied Probability.

[7]  Maria J. Serna,et al.  Approximating Layout Problems on Random Geometric Graphs , 2001, J. Algorithms.

[8]  Alberto Sangiovanni-Vincentelli,et al.  Automatic Layout of Integrated Circuits , 1987 .

[9]  Satish Rao,et al.  Finding near-optimal cuts: an empirical evaluation , 1993, SODA '93.

[10]  M. Penrose.  Single linkage clustering and continuum percolation , 1995 .

[11]  Maria J. Serna,et al.  Convergence Theorems for Some Layout Measures on Random Lattice and Random Geometric Graphs , 2000, Combinatorics, Probability and Computing.

[12]  Ravi B. Boppana,et al.  Eigenvalues and graph bisection: An average-case analysis , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[13]  Jordi Petit Silvestre,et al.  Approximation heuristics and benchmarkings for the MinLA problem , 1997 .

[14]  Jonathan S. Turner,et al.  On the Probable Performance of Heuristics for Bandwidth Minimization , 1986, SIAM J. Comput..

[15]  Frank Harary,et al.  Graph Theory , 2016 .

[16]  Thomas Lengauer.  Upper and Lower Bounds on the Complexity of the Min-Cut Linear Arrangement Problem on Trees , 1982 .

[17]  Cecilia R. Aragon,et al.  Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning , 1989, Oper. Res..

[18]  Maria J. Serna,et al.  Layout Problems on Lattice Graphs , 1999, COCOON.

[19]  L. H. Harper.  Optimal numberings and isoperimetric problems on graphs , 1966 .

[20]  Jacobo Torán,et al.  The MINSUMCUT Problem , 1991, WADS.

[21]  Jordi Petit Silvestre,et al.  Approximating layout problems on random sparse graphs , 1998 .

[22]  Jonathan W. Berry,et al.  Path Optimization for Graph Partitioning Problems , 1999, Discret. Appl. Math..

[23]  Frank Thomson Leighton,et al.  A Framework for Solving VLSI Graph Layout Problems , 1983, J. Comput. Syst. Sci..

[24]  J. Steele.  Probability theory and combinatorial optimization , 1987 .

[25]  Reinhard Lüling,et al.  Combining Helpful Sets and Parallel Simulated Annealing for the Graph-partitioning Problem , 1996, Parallel Algorithms Appl..

[26]  R. Durbin,et al.  Optimal numberings of an N N array , 1986 .

[27]  Jordi Petit Silvestre.  Combining spectral sequencing with simulated annealing for the MinLA problem: sequential and parallel heuristics , 1997 .