An Information-Theoretic Upper Bound on Planar Graphs Using Well-Orderly Maps - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Book Sections Year : 2011
No file

Dates and versions

hal-00649898 , version 1 (09-12-2011)

Identifiers

  • HAL Id : hal-00649898 , version 1

Cite

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⟩
71 View
0 Download

Share

Gmail Facebook Twitter LinkedIn More