An efficient algorithm for generating colored outerplanar graphs

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

Volumn 4484 LNCS, Issue , 2007, Pages 573-583

  Wang, Jiexun ^a   Zhao, Liang ^a   Nagamochi, Hiroshi ^a   Akutsu, Tatsuya ^a  

^a KYOTO UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL GEOMETRY; COMPUTATIONAL METHODS; NUMERICAL METHODS; PROBLEM SOLVING;

COLORED GRAPHS; EFFICIENT ALGORITHMS; OUTERPLANE GRAPHS; VERTICES;

GRAPH THEORY;

EID: 35448939562     PISSN: 03029743     EISSN: 16113349     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-72504-6_52     Document Type: Conference Paper

References (8)

1. T. Akutsu and D. Fukagawa, Inferring a graph from path frequency. In Proc. 16th Annual Symposium on Combinatorial Pattern Matching, Lecture Notes in Computer Science, 3537 (2005), 371-382.
2. T. Akutsu and D. Fukagawa, On inference of a chemical structure from path frequency. In Proc. 2005 International Joint Conference of InCoB, AASBi and KSBI, (2005) 96-100.
3. H. Fujiwara, L. Zhao, H. Nagamochi and T. Akutsu, Enumerating tree-like chemical structures from feature vector (in preparation).
4. T. Horváth, T. Akutsu and S. Wrobel, A refinement operator for outerplanar graphs. In Proc. 16th International Conference of Inductive Logic Programming, (2006) 95-97.
5. G. Li and F. Ruskey, The advantage of forward thinking in generating rooted and free trees. In Proc. 10th Annual ACM-SIAM Symposium on Discrete Algorithms, (1999) 939-940.
6. H. Nagamochi, A detachment algorithm for inferring a graph from path frequency. In Proc. 12th Annual International Computing and Combinatorics Conference (COCOON'06), Lecture Notes in Computer Science, 4112 (2006) 274-283.
7. S. Nakano and T. Uno, Efficient generation of rooted trees, Nil Technical Report (NII-2003-005) (2003) (http://research.nii.ac.jp/TechReports/03-005E. html).
8. S. Nakano and T. Uno, Generating colored trees. Lecture Notes in Computer Science, 3787 (2005) 249-260.