Canonical decomposition of outerplanar maps and application to enumeration, coding and generation

Journal of Graph Algorithms and Applications

Volumn 9, Issue 2, 2005, Pages 185-204

  Bonichon, Nicolas ^a   Gavoille, Cyril ^a   Hanusse, Nicolas ^a  

^a CNRS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

STRUCTURAL OPTIMIZATION;

ASYMPTOTICS; BIJECTIONS; CANONICAL DECOMPOSITION; CONSTANT TIME; LINEAR TIME; NEIGHBOR QUERY; OPTIMAL DATA; ORDERED TREE; RAM MODEL; SPANNING TREE;

MAPS;

EID: 27844530265     PISSN: 15261719     EISSN: 15261719     Source Type: Journal    
DOI: 10.7155/jgaa.00105     Document Type: Article

References (22)

1. L. Alonso, J. L. Rémy, and R. Schott. A linear-time algorithm for the generation of trees. Algorithmica, 17(2):162-182, 1997.
2. D. B. Arnold and M. R. Sleep. Uniform random generation of balanced parenthesis strings. ACM Trans. Programming Languages and Systems, 2(1):122-128, 1980.
3. E. Barcucci, A. del Lungo, and E. Pergola. Random generation of trees and other combinatorial objects. Theoretical Computer Science, 218(2):219-232, 1999.
4. T. Bilski. Embedding graphs in books: A survey. IEE Proceedings-E, 139(2):134-138, Mar. 1992.
5. st Workshop on Algorithms for Listing, Counting, and Enumeration (AL-ICE), Jan. 2003. To appear in Journal of Combinatorics, Probability and Computing.
6. N. Bonichon, C. Gavoille, and N. Hanusse. An information-theoretic upper bound of planar graphs using triangulation. Technical report, LaBRI Research Report RR-1279-02, 2002.
7. th Annual Symposium on Theoretical Aspects of Computer Science (STACS), volume 2607 of Lecture Notes in Computer Science, pages 499-510. Springer, Feb. 2003.
8. G. Chartrand and F. Harary. Planar permutation graphs. Ann. Inst. Henry Poincare, Sec. B3, pages 433-438, 1967.
9. th Symposium on Discrete Algorithms (SODA), pages 506-515. ACM-SIAM, Jan. 2001. To appear in SIAM Journal on Computing.
10. N. Chiba, T. Nishizeki, S. Abe, and T. Ozawa. A linear algorithm for embedding planar graphs using pq-trees. Journal of Computer and System Sciences, 30(1):54-76, 1985.
11. R. Cori and A. Machi. Maps, hypermaps and their automorphisms: a survey i, ii, iii. Expo. Math., 10:403-467, 1992.
12. A. Denise and P. Zimmermann. Uniform random generation of decomposable structures using floating-point arithmetic. Theoretical Computer Science, 218:233-248, 1999.
13. R. Diestel. Graph Theory (second edition), volume 173 of Graduate Texts in Mathematics. Springer, Feb. 2000.
14. P. Epstein and J.-R. Sack. Generating triangulations at random. ACM Trans. Model. and Comput. Simul., 4:267-278, 1994.
15. W. Feller. An Introduction to Probability Theory and its Applications, volume 1. John Wiley & Sons, 1968.
16. P. Flajolet and M. Noy. Analytic combinatorics of non-crossing configurations. Discrete Mathematics, 204:203-229, 1999.
17. M. Goldwurm. Random generation of words in an algebraic language in linear binary space. Information Processing Letters, 54:229-233, 1995.
18. G. Kreweras. Sur les éventails de segments. Cahiers du Bureau Universitaire de Recherche Opérationnelle, 15:1-41, 1970.
19. S. L. Mitchell. Linear algorithms to recognize outerplanar and maximal outerplanar graphs. Information Processing Letters, pages 229-232, 1979.
20. J. I. Munro and V. Raman. Succinct representation of balanced parentheses, static trees and planar graphs. SIAM Journal on Computing, 31(3):762-776, 2001.
21. T. V. Narayana. A partial order and its application to probability. Sankhya, 21:91-98, 1959.
22. H. Wilf. A unified setting for sequencing, ranking, and selection algorithms for combinatorial objects. Advances in Mathematics, 24:281-291, 1977.