Enumerating rooted graphs with reflectional block structures

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

Volumn 6078 LNCS, Issue , 2010, Pages 49-60

  Zhuang, Bingbing ^a   Nagamochi, Hiroshi ^a  

^a KYOTO UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

BICONNECTED COMPONENTS; BLOCK STRUCTURES; CONSTANT TIME; EMBEDDINGS; ENUMERATION ALGORITHMS; REFLECTIONAL SYMMETRY; CLASS B; CLASS H;

GRAPHIC METHODS;

ALGORITHMS; COMPUTATIONAL COMPLEXITY;

EID: 77953789670     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-13073-1_6     Document Type: Conference Paper

References (7)

1. Fujiwara, H., Wang, J., Zhao, L., Nagamochi, H., Akutsu, T.: Enumerating tree-like chemical graphs with given path frequency. Journal of Chemical Information and Modeling 48, 1345-1357 (2008)
2. Ishida, Y., Zhao, L., Nagamochi, H., Akutsu, T.: Improved algorithm for enumerating tree-like chemical graphs. In: The 19th International Conference on Genome Informatics, Gold Coast, Australia, December 1-3 (2008); Genome Informatics 21, 53-64 (2008)
3. Li, G., Ruskey, F.: The advantage of forward thinking in generating rooted and free trees. In: Proc. 10th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 939-940 (1999)
4. Nakano, S., Uno, T.: Efficient generation of rooted trees, NII Technical Report, NII-2003-2005 (2003)
5. Nakano, S., Uno, T.: Generating colored trees. In: Kratsch, D. (ed.) WG 2005. LNCS, vol.3787, pp. 249-260. Springer, Heidelberg (2005)
6. Zhuang, B., Nagamochi, H.: Enumerating rooted biconnected planar graphs with internally triangulated faces, Dept. of Applied Mathematics and Physics, Graduate School of Informatics, Kyoto University, Technical Report 2009-018 (2009)
7. Zhuang, B., Nagamochi, H.: Enumerating rooted graphs with reflectional block structures, Dept. of Applied Mathematics and Physics, Kyoto University, Technical Report 2009-019 (2009)