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
2 LaBRI - Laboratoire Bordelais de Recherche en Informatique
3 UB - Université Sciences et Technologies - Bordeaux 1
4 IUF - Institut universitaire de France

Domaines: Algorithme et structure de données [cs.DS]

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⟩