Random cubic planar graphs revisited
View/Open
Extended Abstract - Barcelona DMD16-v3.pdf (89,77Kb) (Restricted access)
Request copy
Què és aquest botó?
Aquest botó permet demanar una còpia d'un document restringit a l'autor. Es mostra quan:
- Disposem del correu electrònic de l'autor
- El document té una mida inferior a 20 Mb
- Es tracta d'un document d'accés restringit per decisió de l'autor o d'un document d'accés restringit per política de l'editorial
Cita com:
hdl:2117/103660
Document typeOther
Defense date2016
PublisherElsevier
Rights accessRestricted access - publisher's policy
Except where otherwise noted, content on this work
is licensed under a Creative Commons license
:
Attribution-NonCommercial-NoDerivs 3.0 Spain
Abstract
The goal of our work is to analyze random cubic planar graphs according to the
uniform distribution. More precisely, let G be the class of labelled cubic planar
graphs and let gn be the number of graphs with n vertices. Then each graph in G
with n vertices has the same probability 1/gn.
CitationRue, J., Noy, M., Requile, C. Random cubic planar graphs revisited. A: Jornadas de Matemática Discreta y Algorítmica. "Proceedings Discrete Mathematics Days". Barcelona: Elsevier, 2016, p. 211-216.
Files | Description | Size | Format | View |
---|---|---|---|---|
Extended Abstract - Barcelona DMD16-v3.pdf![]() | 89,77Kb | Restricted access |