Treffer: Bounds on the bisection width for random d-regular graphs
Title:
Bounds on the bisection width for random d-regular graphs
Authors:
Source:
Latin American theoretical informaticsTheoretical computer science. 382(2):120-130
Publisher Information:
Amsterdam: Elsevier, 2007.
Publication Year:
2007
Physical Description:
print, 25 ref
Original Material:
INIST-CNRS
Subject Terms:
Computer science, Informatique, Sciences exactes et technologie, Exact sciences and technology, Sciences et techniques communes, Sciences and techniques of general use, Mathematiques, Mathematics, Combinatoire. Structures ordonnées, Combinatorics. Ordered structures, Combinatoire, Combinatorics, Théorie des graphes, Graph theory, Sciences appliquees, Applied sciences, Informatique; automatique theorique; systemes, Computer science; control theory; systems, Informatique théorique, Theoretical computing, Algorithmique. Calculabilité. Arithmétique ordinateur, Algorithmics. Computability. Computer arithmetics, Recherche information. Graphe, Information retrieval. Graph, Divers, Miscellaneous, Algorithme glouton, Greedy algorithm, Algoritmo glotón, Approximation numérique, Numerical approximation, Aproximación numérica, Borne inférieure, Lower bound, Cota inferior, Borne supérieure, Upper bound, Cota superior, Graphe aléatoire, Random graph, Grafo aleatorio, Graphe régulier, Regular graph, Grafo regular, Informatique théorique, Computer theory, Informática teórica, Largeur, Width, Ancho, Maximum, Máximo, Performance, Rendimiento, 05C80, 65D99, 65Dxx, 68R10, 68W20, 68Wxx, Randomized algorithm, Bisection width, Random regular graphs
Document Type:
Konferenz
Conference Paper
File Description:
text
Language:
English
Author Affiliations:
Dept. Llenguatges i Sistemes, Universitat Politecnica de Catalunya, Jordi Girona Salgado 1-3, 08034 Barcelona, Spain
Dept. Combinatorics and Optimization, University of Waterloo, N2L3G1, Canada
Dept. Combinatorics and Optimization, University of Waterloo, N2L3G1, Canada
ISSN:
0304-3975
Rights:
Copyright 2008 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Computer science; theoretical automation; systems
Mathematics
Mathematics
Accession Number:
edscal.19033244
Database:
PASCAL Archive
Weitere Informationen
In this paper we provide an explicit way to compute asymptotically almost sure upper bounds on the bisection width of random d-regular graphs, for any value of d. The upper bounds are obtained from the analysis of the performance of a randomized greedy algorithm to find bisections of d-regular graphs. We provide bounds for 5 ≤ d ≤ 12. We also give empirical values of the size of the bisection found by the algorithm for some small values of d and compare them with numerical approximations of our theoretical bounds. Our analysis also gives asymptotic lower bounds for the size of the maximum bisection.