An information-theoretic upper bound of planar graphs using triangulation

DOI10.1007/3-540-36494-3_44MaRDI QIDQ4418676zbMATH OpenFDO

Authors Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse

Publication date 11 August 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2607/26070499.htm

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Planar graphs, via well-orderly maps and trees
• Planar graphs, via well-orderly maps and trees
• An Information-Theoretic Upper Bound on Planar Graphs Using Well-Orderly Maps
• A Fast General Methodology for Information-Theoretically Optimal Encodings of Graphs
• On the succinct representation of graphs

Cited in

(17)

• Intervals in Catalan lattices and realizers of triangulations
• Random planar graphs
• Generating labeled planar graphs uniformly at random
• Planar polyline drawings via graph transformations
• Planar graphs, via well-orderly maps and trees
• A compact encoding of plane triangulations with efficient query supports
• An Information-Theoretic Upper Bound on Planar Graphs Using Well-Orderly Maps
• Encoding toroidal triangulations
• A Compact Encoding of Plane Triangulations with Efficient Query Supports
• Generating unlabeled connected cubic planar graphs uniformly at random
• Planar graphs, via well-orderly maps and trees
• Structural parameters of Schnyder woods
• A bijection for essentially 4-connected toroidal triangulations
• An improved lower bound on the number of pseudoline arrangements
• Contractible sets in 3-connected planar graphs via Schnyder woods
• Schnyder woods for higher genus triangulated surfaces, with applications to encoding
• Quick encoding of plane graphs in \(\log _{2}14\) bits per edge

Describes a project that uses

Uses Software

• Edgebreaker

This page was built for publication: An information-theoretic upper bound of planar graphs using triangulation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4418676)