Efficient generation of triconnected plane triangulations

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

Volumn 2108, Issue , 2001, Pages 131-141

  Nakano, Shin Ichi ^a  

^a GUNMA UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPH THEORY;

A-PLANE; PLANAR GRAPH; SIMPLE ALGORITHM;

TRIANGULATION;

EID: 84944077715     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44679-6_15     Document Type: Conference Paper

References (9)

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. L. A. Goldberg, Efficient algorithms for listing combinatorial structures, Cambridge University Press, New York, (1993).
4. J. E. Hopcroft and J.K. Wong, Linear time algorithm for isomorphism of planar graphs, Proc. of 6th STOC, (1974), pp.172-184.
5. D. L. Kreher and D. R. Stinson, Combinatorial algorithms, CRC Press, Boca Raton, (1998).
6. Z. Li and S. Nakano, Efficient Generation of Plane Triangulations, ICALP 2001, accepted.
7. B. D. McKay, Isomorph-free exhaustive generation, J. of Algorithms, 26, (1998), pp.306-324.
8. S. Nakano, Efficient Generation of Triconnected Plane Triangulations, Technical Report, GU-CS-01-1, Dept. of Comp. Sci., Gunma Univ., http://www.msc.cs.gunma-u.ac.jp/nakanolab/TR/GU-CS-01-1.ps (2001).
9. 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.