{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T05:34:07Z","timestamp":1725514447685},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540725039"},{"type":"electronic","value":"9783540725046"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-72504-6_52","type":"book-chapter","created":{"date-parts":[[2007,7,22]],"date-time":"2007-07-22T07:36:39Z","timestamp":1185089799000},"page":"573-583","source":"Crossref","is-referenced-by-count":2,"title":["An Efficient Algorithm for Generating Colored Outerplanar Graphs"],"prefix":"10.1007","author":[{"given":"Jiexun","family":"Wang","sequence":"first","affiliation":[]},{"given":"Liang","family":"Zhao","sequence":"additional","affiliation":[]},{"given":"Hiroshi","family":"Nagamochi","sequence":"additional","affiliation":[]},{"given":"Tatsuya","family":"Akutsu","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"52_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1007\/11496656_32","volume-title":"Combinatorial Pattern Matching","author":"T. Akutsu","year":"2005","unstructured":"Akutsu, T., Fukagawa, D.: Inferring a graph from path frequency. In: Apostolico, A., Crochemore, M., Park, K. (eds.) CPM 2005. LNCS, vol.\u00a03537, pp. 371\u2013382. Springer, Heidelberg (2005)"},{"key":"52_CR2","unstructured":"Akutsu, T., Fukagawa, D.: On inference of a chemical structure from path frequency. In: Proc. 2005 International Joint Conference of InCoB, AASBi and KSBI, pp. 96\u2013100 (2005)"},{"key":"52_CR3","unstructured":"Fujiwara, H., et al.: Enumerating tree-like chemical structures from feature vector (in preparation)"},{"key":"52_CR4","unstructured":"Horv\u00e1th, T., Akutsu, T., Wrobel, S.: A refinement operator for outerplanar graphs. In: Proc. 16th International Conference of Inductive Logic Programming, pp. 95\u201397 (2006)"},{"key":"52_CR5","unstructured":"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\u2013940 (1999)"},{"key":"52_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1007\/11809678_30","volume-title":"Computing and Combinatorics","author":"H. Nagamochi","year":"2006","unstructured":"Nagamochi, H.: A detachment algorithm for inferring a graph from path frequency. In: Chen, D.Z., Lee, D.T. (eds.) COCOON 2006. LNCS, vol.\u00a04112, pp. 274\u2013283. Springer, Heidelberg (2006)"},{"key":"52_CR7","unstructured":"Nakano, S., Uno, T.: Efficient generation of rooted trees, NII Technical Report (NII-2003-005) (2003), \n                    \n                      http:\/\/research.nii.ac.jp\/TechReports\/03-005E.html"},{"key":"52_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/11604686_22","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"S. Nakano","year":"2005","unstructured":"Nakano, S., Uno, T.: Generating colored trees. In: Kratsch, D. (ed.) WG 2005. LNCS, vol.\u00a03787, pp. 249\u2013260. Springer, Heidelberg (2005)"}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Models of Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-72504-6_52.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T05:38:25Z","timestamp":1619501905000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-72504-6_52"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540725039","9783540725046"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-72504-6_52","relation":{},"subject":[]}}