Josep Diaz, Mathew D. Penrose, Jordi Petit, Maria Serna  Home/Search
Context
Related
| lsi.upc.es/~diaz/papersd/cpc.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: lsi.upc.es/~diaz/papers (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: 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... (Update)
Similar documents (at the sentence level):
50.9%: Convergence Theorems for Some Layout Measures on Random .. - Diaz, Penrose, Petit.. (Correct)
5.4%: Layout Problems on Lattice Graphs - Díaz, Penrose, Petit, Serna (Correct)
Active bibliography (related documents): More All
0.5: Approximating Layout Problems on Random Geometric Graphs - Díaz, Penrose, Petit, Serna (2001) (Correct)
0.3: A Survey on Graph Layout Problems - Díaz, Petit, Serna (2000) (Correct)
0.2: A Polynomial Time Algorithm for the Cutwidth of Bounded .. - Thilikos, Serna.. (2001) (Correct)
Similar documents based on text: More All
0.6: Linear Orderings of Random Geometric Graphs - Diaz, Penrose, Petit, Serna (1997) (Correct)
0.5: Linear Orderings of Random Geometric Graphs (Extended.. - Diaz, Penrose, Petit.. (1999) (Correct)
0.5: Approximating Layout Problems on Geometric Random.. - Diaz, Penrose, Petit.. (1998) (Correct)
BibTeX entry: (Update)
@misc{ diaz-convergence,
author = "Josep Diaz and Mathew D. Penrose and Jordi Petit and Maria Serna",
title = "Convergence Theorems for Some Layout Measures on Random Lattice and Random
Geometric Graphs",
url = "citeseer.ist.psu.edu/716914.html" }
Citations (may not include all citations):147 A Course in Probability Theory (context) - Chung - 1974
86 A framework for solving VLSI graph layout problems - Bhatt, Leighton - 1984
61 The shortest path through many points (context) - Beardwood, Halton et al. - 1959
39 Optimal linear ordering (context) - Adolphson, Hu - 1973
24 Cluster analysis for hypertext systems (context) - Botafogo - 1993
16 Single machine job sequencing with precedence constraints (context) - Adolphson - 1977
16 Path optimization for graph partitioning problems - Berry, Goldberg - 1999
7 Compressions and isoperimetric inequalities (context) - Bollobas, Leader - 1991
7 Layout problems on lattice graphs - D'iaz, Penrose et al. - 1999
5 Random geometric problems - D'iaz, Petit et al.
1 Linear orderings of random geometric graphs - D'iaz, Penrose et al. - 1999
Documents on the same site (http://www-lsi.upc.es/~diaz/papers.html): More
Recent results on Parameterized H-Coloring - Diaz, Serna, Thilikos (Correct)
Chromatic Number in Random Scaled Sector Graphs - Diaz, Sanwalani, Serna, Spirakis (Correct)
Bounds on the Max and Min Bisection of Random Cubic and.. - Diaz, Do, Serna, Wormald (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC