Layout Problems on Lattice Graphs

@inproceedings{Daz1999LayoutPO,
  title={Layout Problems on Lattice Graphs},
  author={Josep D{\'i}az and Mathew D. Penrose and Jordi Petit and Maria J. Serna},
  booktitle={COCOON},
  year={1999}
}
This work deals with bounds on the cost of layout problems for lattice graphs and random lattice graphs. Our main result in this paper is a convergence theorem for the optimal cost of the Minimum Linear Arrangement problem and the Minimum Sum Cut problem, for the case where the underlying graph is obtained through a subcritical site percolation process. This result can be viewed as an analogue of the Beardwood, Halton and Hammersley theorem for the Euclidian TSP. Finally we estimate empirically… 

Vertex ordering and partitioning problems for random spatial graphs

Given an ordering of the vertices of a finite graph, let the induced weight for an edge be the separation of its endpoints in the ordering. Layout problems involve choosing the ordering to minimize a

Convergence Theorems for Some Layout Measures on Random Lattice and Random Geometric Graphs

TLDR
The main results are convergence theorems that can be viewed as an analogue of the Beardwood, Halton and Hammersley theorem for the Euclidean TSP on random points in the unit square.

A survey of graph layout problems

TLDR
A complete view of the current state of the art with respect to layout problems from an algorithmic point of view is presented.

Linear Orderings of Random Geometric Graphs

TLDR
It is proved that some of these layout problems on random geometric graphs remain NP-complete even for geometric graphs, and the probabilistic behavior of the lexicographic ordering for these problems on the class ofrandom geometric graphs is characterized.

Approximating Layout Problems on Random Geometric Graphs

TLDR
This paper proves that some of the layout problems on a family of random geometric graphs remain NP-complete even for geometric graphs, and presents two heuristics that, almost surely, turn out to be constant approximation algorithms for their layout problems.

A Polynomial Time Algorithm for the Cutwidth of Bounded Degree Graphs with Small Treewidth

TLDR
This work shows how to construct an algorithm that, in nO(w2d) steps, computes the cutwidth of any partial w-tree with vertices of degree bounded by a fixed constant d.

CUTWIDTH OF CERTAIN CLASSES OF CIRCULANT NETWORKS

The cutwidth problem of a graph G is to embed G into a path such that the maximum number of edges crossing along any cut in the path is minimized. A circulant graph Cmk(1, k) is a graph with vertex

References

SHOWING 1-10 OF 22 REFERENCES

Vertex ordering and partitioning problems for random spatial graphs

Given an ordering of the vertices of a finite graph, let the induced weight for an edge be the separation of its endpoints in the ordering. Layout problems involve choosing the ordering to minimize a

Linear Orderings of Random Geometric Graphs

TLDR
It is proved that some of these layout problems on random geometric graphs remain NP-complete even for geometric graphs, and the probabilistic behavior of the lexicographic ordering for these problems on the class ofrandom geometric graphs is characterized.

The bisection width of grid graphs

TLDR
A polynomial algorithm for computing the minimum number of edges the authors need to delete in order to divide a given solid grid graph into two parts containing an equal number of nodes is presented.

Optimal numberings of an N N array

Given a numbering of the vertices of a graph, one can define the edgesum [6] as the sum of differences between adjacent vertices. The problem of finding numberings which are optimal in the sense of

Linear Layouts of Generalized Hypercubes

TLDR
The bisection width, cut width, and total edge length of generalized hypercubes are evaluated to measure the complexity of them in terms of a linear layout.

The shortest path through many points

ABSTRACT We prove that the length of the shortest closed path through n points in a bounded plane region of area v is ‘almost always’ asymptotically proportional to √(nv) for large n; and we extend

Approximation heuristics and benchmarkings for the MinLA problem

TLDR
The conclusion is that the best approximations are obtained using Simulated Annealing, which involves a large amount of computation time, however, solutions found by Spectral Sequencing are also good and can be found in radically less time.

On Path-Tough Graphs

TLDR
The authors prove that every graph of order n and minimum degree at least $\[3/(6+\sqrt{3})\]n$ is Hamiltonian if and only if it is path-tough.

Combining spectral sequencing with simulated annealing for the MinLA problem: sequential and parallel heuristics

TLDR
A special neighborhood distribution that tends to favor moves with high probability to be accepted is presented that improves the solution quality, decreases the running time and offers an excellent speedup when ran on a commodity network made of nine personal computers.

Percolation ?

572 NOTICES OF THE AMS VOLUME 53, NUMBER 5 Percolation is a simple probabilistic model which exhibits a phase transition (as we explain below). The simplest version takes place on Z2, which we view