Planar graphs, via well-orderly maps and Trees

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3353, Issue , 2004, Pages 270-284

  Bonichon, Nicolas ^a   Gavoille, Cyril ^b   Hanusse, Nicolas ^c   Poulalhon, Dominique ^a   Schaeffer, Gilles ^b  

^a UNIVERSITÉ BORDEAUX 1   (France)

^b UNIVERSITÉ PARIS DIDEROT   (France)

^c ÉCOLE POLYTECHNIQUE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

TREES (MATHEMATICS); GRAPHIC METHODS;

COMBINATORIAL ANALYSIS; EMBEDDINGS; ENCODING ALGORITHMS; LINEAR TIME; PLANAR GRAPH; PLANAR MAPS; PROPERTY; TIME ENCODING; UPPER BOUND;

GRAPHIC METHODS; GRAPH THEORY;

EID: 33745641239     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30559-0_23     Document Type: Article

References (28)

1. Liskovets, V.A., Walsh, T.R.: Ten steps to counting planar graphs. Congrcssus Numerantium 60 (1987) 269-277
2. Denise, A., Vasconcellos, M., Welsh, D.J.: The random planar graph. Congressus Numerantium 113 (1996) 61-79
3. McDiarmid, C.J., Steger, A., Welsh, D.J.: Random planar graphs (2001) Preprint.
4. rd Colloquium on Mathematics and Computer Science: Algorithms, Trees, Combinatorics and Probabilities, Birkhäuser (2004)
5. th Annual Symposium on Theoretical Aspects of Computer Science (STAGS). Volume 2607 of Lecture Notes in Computer Science., Springer (2003) 499-510
6. Bender, E.A., Gao, Z., Wormald, N.C.: The number of labeled 2-connected planar graphs. The Electronic Journal of Combinatorics 9 (2002) R43
7. Wright, E.M.: Graphs on unlabelled nodes with a given number of edges. Acta Math. 126 (1971) 1-9
8. Khodakovsky, A., Alliez, P., Desbrun, M., Schröder, P.: Near-optimal connectivity encoding of 2-manifold polygon meshes. Graphical Models (2002) To appear in a special issue.
9. th Canadian Conference on Computational Geometry. (1999) 146-149
10. Rossignac, J.: Edgebreaker: Connectivity compression for triangle meshes. IEEE Transactions on Visualization and Computer Graphics 5 (1999) 47-61
11. Prederickson, G.N., Janardan, R.: Efficient message routing in planar networks. SIAM Journal on Computing 18 (1989) 843-857
12. th International Colloquium on Automata, Languages and Programming (ICALP). Volume 1644 of LNCS., Springer (1999) 351-360
13. th Annual International Computing & Combinatorics Conference (COCOON). Volume 2387 of LNCS., Springer (2002) 57-66
14. th Annual IEEE Symposium on Foundations of Computer Science (FOGS), IEEE Computer Society Press (2001)
15. th International Colloquium on Automata, Languages and Programming (ICALP). Volume 2719 of LNCS. (2003) 1095-1107
16. Gerke, S., McDiarmid, C.J.: On the number of edges in random planar graphs. Combinatorics, Probability & Computing (2002) To appear.
17. Turán, G.: Succinct representations of graphs. Discrete Applied Mathematics 8 (1984) 289-294
18. Keeler, K., Westbrook, J.: Short encodings of planar graphs and maps. Discrete Applied Mathematics 58 (1995) 239-252
19. th Annual IEEE Symposium on Foundations of Computer Science (FOGS), IEEE Computer Society Press (1997) 118-126
20. Yannakakis, M.: Embedding planar graphs in four pages. Journal of Computer and System Sciences 38 (1989) 36-67
21. th Symposium on Discrete Algorithms (SODA), ACM-SIAM (2001) 506-515
22. th International Colloquium on Automata, Languages and Programming (ICALP). Volume 1443 of LNCS., Springer (1998) 118-129
23. st Symposium on Discrete Algorithms (SODA), ACM-SIAM (1990) 138-148
24. th International Colloquium on Automata, Languages and Programming (ICALP). Volume 2719 of LNCS., Springer (2003) 1080-1094
25. Goulden, I., Jackson, D.: Combinatorial Enumeration. John Wiley & Sons (1983)
26. th International Colloquium on Automata, Languages and Programming (ICALP). Volume 2380 of LNCS., Springer (2002) 1043-1053
27. Zhang, H., He, X.: Compact visibility representation and straight-line grid embedding of plane graphs. In: Workshop on Algorithms and Data Structures (WADS). Volume 2748 of LNCS., Springer (2003) 493-504
28. th International Workshop, Graph - Theoretic Concepts in Computer Science (WG). Volume 2573 of LNCS., Springer (2002) 35-46