Treffer: Generating labeled planar graphs uniformly at random
Title:
Generating labeled planar graphs uniformly at random
Authors:
Source:
Automata, languages and programming (ICALP 2003)Theoretical computer science. 379(3):377-386
Publisher Information:
Amsterdam: Elsevier, 2007.
Publication Year:
2007
Physical Description:
print, 31 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, Analyse mathématique, Mathematical analysis, Calcul des variations et contrôle optimal, Calculus of variations and optimal control, 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 déterministe, Deterministic algorithms, Comptage, Counting, Contaje, Dynamique, Dynamics, Dinámica, Echantillon, Sample, Muestra, Echantillonnage, Sampling, Muestreo, Enumération, Enumeration, Enumeración, Etiquette, Label, Etiqueta, Graphe connexe, Connected graph, Grafo conexo, Graphe marqué, Labelled graph, Grafo marcado, Graphe planaire, Planar graph, Grafo planario, Informatique théorique, Computer theory, Informática teórica, Méthode décomposition, Decomposition method, Método descomposición, Polynôme, Polynomial, Polinomio, Programmation dynamique, Dynamic programming, Programación dinámica, Temps polynomial, Polynomial time, Tiempo polinomial, Théorie graphe, Graph theory, Teoría grafo, 05Cxx, 49Lxx, 68R10, 68Wxx, Algorithme polynomial, Composante connexe, Graphe étiqueté, Decomposition, Labeled planar graph, Sampling algorithm
Document Type:
Konferenz
Conference Paper
File Description:
text
Language:
English
Author Affiliations:
Humboldt-Universität zu Berlin, Institut für Informatik, Abteilung Algorithmen und Komplexität I, Unter den Linden 6, 10099 Berlin, Germany
Freie Universität Berlin, Institut für Informatik, Algorithmische Bioinformatik, Takustraße 9, 14195 Berlin, Germany
Freie Universität Berlin, Institut für Informatik, Algorithmische Bioinformatik, Takustraße 9, 14195 Berlin, Germany
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.18821599
Database:
PASCAL Archive
Weitere Informationen
We present a deterministic polynomial time algorithm to sample a labeled planar graph uniformly at random. Our approach uses recursive formulae for the exact number of labeled planar graphs with n vertices and m edges, based on a decomposition into 1-, 2-, and 3-connected components. We can then use known sampling algorithms and counting formulae for 3-connected planar graphs.