Optimal numberings of an N N array
SIAM Journal on Algebraic and Discrete Methods
Compressions and isoperimetric inequalities
Journal of Combinatorial Theory Series A
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Cluster analysis for hypertext systems
SIGIR '93 Proceedings of the 16th annual international ACM SIGIR conference on Research and development in information retrieval
Mapping the genome: some combinatorial problems arising in molecular biology
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Single linkage clustering and continuum percolation
Journal of Multivariate Analysis
Path optimization for graph partitioning problems
Discrete Applied Mathematics - Special volume on VLSI
Finding near-optimal cuts: an empirical evaluation
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
The bisection width of grid graphs
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Minimizing Width in Linear Layouts
Proceedings of the 10th Colloquium on Automata, Languages and Programming
Ordering Problems Approximated: Single-Processor Scheduling and Interval Graph Completion
ICALP '91 Proceedings of the 18th International Colloquium on Automata, Languages and Programming
A Polyhedral Approach to Planar Augmentation and Related Problems
ESA '95 Proceedings of the Third Annual European Symposium on Algorithms
Iterative Methods for Sparse Linear Systems
Iterative Methods for Sparse Linear Systems
Layout problems on lattice graphs
COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
On the minimum node degree and connectivity of a wireless multihop network
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
A survey of graph layout problems
ACM Computing Surveys (CSUR)
The Critical Transmitting Range for Connectivity in Sparse Wireless Ad Hoc Networks
IEEE Transactions on Mobile Computing
Random channel assignment in the plane
Random Structures & Algorithms
Experiments on the minimum linear arrangement problem
Journal of Experimental Algorithmics (JEA)
The Critical Transmitting Range for Connectivity in Mobile Ad Hoc Networks
IEEE Transactions on Mobile Computing
Topology control in wireless ad hoc and sensor networks
ACM Computing Surveys (CSUR)
Cutwidth II: algorithms for partial w-trees of bounded degree
Journal of Algorithms
IEEE Journal on Selected Areas in Communications - Special issue on stochastic geometry and random graphs for the analysis and designof wireless networks
Slab routing: adapting two-dimensional geographic routing to three-dimensions
SECON'09 Proceedings of the 6th Annual IEEE communications society conference on Sensor, Mesh and Ad Hoc Communications and Networks
Cutwidth II: Algorithms for partial w-trees of bounded degree
Journal of Algorithms
Impact of region-based faults on the connectivity of wireless networks
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
FORTE'05 Proceedings of the 25th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
Quantitative analysis of multi-hop wireless networks using a novel paradigm
ESCAPE'07 Proceedings of the First international conference on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies
Hi-index | 0.00 |
This work deals with convergence theorems and bounds on the cost of several layout measures for lattice graphs, random lattice graphs and sparse random geometric graphs. Specifically, we consider the following problems: Minimum Linear Arrangement, Cutwidth, Sum Cut, Vertex Separation, Edge Bisection and Vertex Bisection. For full square lattices, we give optimal layouts for the problems still open. For arbitrary lattice graphs, we present best possible bounds disregarding a constant factor. We apply percolation theory to the study of lattice graphs in a probabilistic setting. In particular, we deal with the subcritical regime that this class of graphs exhibits and characterize the behaviour of several layout measures in this space of probability. We extend the results on random lattice graphs to random geometric graphs, which are graphs whose nodes are spread at random in the unit square and whose edges connect pairs of points which are within a given distance. We also characterize the behaviour of several layout measures on random geometric graphs in their subcritical regime. Our 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.