Skip to Main content Skip to Navigation
Book sections

An Information-Theoretic Upper Bound on Planar Graphs Using Well-Orderly Maps

Nicolas Bonichon 1, 2, 3 Cyril Gavoille 1, 2, 4 Nicolas Hanusse 1, 2
1 CEPAGE - Algorithmics for computationally intensive applications over wide scale distributed platforms
Université Sciences et Technologies - Bordeaux 1, Inria Bordeaux - Sud-Ouest, École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB), CNRS - Centre National de la Recherche Scientifique : UMR5800
Document type :
Book sections
Complete list of metadata

https://hal.inria.fr/hal-00649898
Contributor : Nicolas Bonichon <>
Submitted on : Friday, December 9, 2011 - 7:58:20 AM
Last modification on : Tuesday, February 9, 2021 - 3:00:04 PM

Identifiers

  • HAL Id : hal-00649898, version 1

Collections

Citation

Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse. An Information-Theoretic Upper Bound on Planar Graphs Using Well-Orderly Maps. Dehmer, Matthias and Emmert-Streib, Frank and Mehler, Alexander. Towards an Information Theory of Complex Networks, Birkhäuser Boston, pp.17-46, 2011, 978-0-8176-4904-3. ⟨hal-00649898⟩

Share

Metrics

Record views

281