Efficient generation of plane triangulations without repetitions

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

Volumn 2076 LNCS, Issue , 2001, Pages 433-443

  Li, Zhangjian ^a   Nakano, Shin Ichi ^a  

^a GUNMA UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; GRAPH THEORY; ALGORITHMS; COMPUTATIONAL LINGUISTICS; TRIANGULATION;

A-PLANE; PLANAR GRAPH; SIMPLE ALGORITHM;

TRIANGULATION; SURVEYING;

EID: 84879539326     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48224-5_36     Document Type: Conference Paper

References (10)

1. D. Avis, Generating rooted triangulations without repetitions, Algorithmica, 16, (1996), pp. 618-632.
2. T. Beyer and S. M. Hedetniemi, Constant time generation of rooted trees, SIAM J. Comput. , 9, (1980), pp. 706-712.
3. M. Chrobak and S. Nakano, Minimum-width grid drawings of plane graphs, Computational Geometry: Theory and Applications, 10, (1998), pp. 29-54.
4. H. de Fraysseix, J. Pach and R. Pollack, How to draw a planar graph on a grid, Combinatorica, 10, (1990), pp. 41-51.
5. L. A. Goldberg, Efficient algorithms for listing combinatorial structures, Cambridge University Press, New York, (1993).
6. J. E. Hopcroft and J. K. Wong, Linear time algorithm for isomorphism of planar graphs, Proc. of 6th STOC, (1974), pp. 172-184.
7. D. L. Kreher and D. R. Stinson, Combinatorial algorithms, CRC Press, Boca Raton, (1998).
8. B. D. McKay, Isomorph-free exhaustive generation, J. of Algorithms, 26, (1998), pp. 306-324.
9. W. Schnyder, Embedding planar graphs on the grid, Proc. 1st Annual ACM-SIAM Symp. on Discrete Algorithms, San Francisco, (1990), pp. 138-148.
10. R. A. Wright, B. Richmond, A. Odlyzko and B. D. McKay, Constant time generation of free trees, SIAM J. Comput. , 15, (1986), pp. 540-548.