论文信息 - Generating All Series-Parallel Graphs - 字舞流文

Generating All Series-Parallel Graphs

In this paper we give an algorithm to generates all series-parallel graphs with at most m edges. This algorithm generate each series-parallel graph in constant time on average.

Shin-Ichi Nakano | Shin-ichiro Kawano

[1] Shin-Ichi Nakano,et al. Efficient generation of triconnected plane triangulations , 2001, Comput. Geom..

[2] Herbert S. Wilf,et al. Combinatorial Algorithms: An Update , 1987 .

[3] Shin-Ichi Nakano,et al. Efficient Generation of Plane Triangulations without Repetitions , 2001, ICALP.

[4] R. Read. Every one a Winner or how to Avoid Isomorphism Search when Cataloguing Combinatorial Configurations , 1978 .

[5] Shin-Ichi Nakano,et al. Efficient generation of plane trees , 2002, Inf. Process. Lett..

[6] Brendan D. McKay,et al. Constant Time Generation of Free Trees , 1986, SIAM J. Comput..

[7] Frank Ruskey,et al. The advantages of forward thinking in generating rooted and free trees , 1999, SODA '99.

[8] Leslie Ann Goldberg,et al. Efficient algorithms for listing combinatorial structures , 1993 .

[9] Sandra Mitchell Hedetniemi,et al. Constant Time Generation of Rooted Trees , 1980, SIAM J. Comput..

[10] Brendan D. McKay,et al. Isomorph-Free Exhaustive Generation , 1998, J. Algorithms.