{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:31:55Z","timestamp":1725543115819},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540369257"},{"type":"electronic","value":"9783540369264"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11809678_30","type":"book-chapter","created":{"date-parts":[[2006,8,15]],"date-time":"2006-08-15T13:41:33Z","timestamp":1155649293000},"page":"274-283","source":"Crossref","is-referenced-by-count":3,"title":["A Detachment Algorithm for Inferring a Graph from Path Frequency"],"prefix":"10.1007","author":[{"given":"Hiroshi","family":"Nagamochi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"30_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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":"30_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 (BIOINFO 2005), Busan, Korea, pp. 96\u2013100 (2005)"},{"key":"30_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/978-3-540-28649-3_31","volume-title":"Pattern Recognition","author":"G.H. Bakir","year":"2004","unstructured":"Bakir, G.H., Zien, A., Tsuda, K.: Learning to find graph pre-images. In: Rasmussen, C.E., B\u00fclthoff, H.H., Sch\u00f6lkopf, B., Giese, M.A. (eds.) DAGM 2004. LNCS, vol.\u00a03175, pp. 253\u2013261. Springer, Heidelberg (2004)"},{"key":"30_CR4","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1002\/jgt.10104","volume":"43","author":"A.R. Berg","year":"2003","unstructured":"Berg, A.R., Jackson, B., Jord\u00e1n, T.: Highly edge-connected detachments of graphs and digraphs. J. Graph Theory\u00a043, 67\u201377 (2003)","journal-title":"J. Graph Theory"},{"key":"30_CR5","doi-asserted-by":"publisher","first-page":"948","DOI":"10.1137\/0215066","volume":"15","author":"W.H. Cunningham","year":"1986","unstructured":"Cunningham, W.H.: Improved bounds for matroid partition and intersection algorithms. SIAM J. Computing\u00a015, 948\u2013957 (1986)","journal-title":"SIAM J. Computing"},{"key":"30_CR6","first-page":"69","volume-title":"Combinatorial Structures and Their Applications","author":"J. Edmonds","year":"1970","unstructured":"Edmonds, J.: Matroids, submodular functions, and certain polyhedra. In: Guy, R.K., Hanani, H., Sauer, N., Sch\u00f6nheim, J. (eds.) Combinatorial Structures and Their Applications, pp. 69\u201387. Gordon and Breach, New York (1970)"},{"key":"30_CR7","unstructured":"Fukunaga, T., Nagamochi, H.: Eulerian detachments with local-edge-connectivity (submitted to a journal)"},{"key":"30_CR8","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/S0095-8956(02)00026-6","volume":"87","author":"B. Jackson","year":"2003","unstructured":"Jackson, B., Jord\u00e1n, T.: Non-separable detachments of graphs. J. Combin. Theory (B)\u00a087, 17\u201337 (2003)","journal-title":"J. Combin. Theory (B)"},{"key":"30_CR9","unstructured":"Kashima, H., Tsuda, K., Inokuchi, A.: Marginalized kernels between labeled graphs. In: Proc. of the 20th Int. Conf. on Machine Learning, pp. 321\u2013328 (2003)"},{"key":"30_CR10","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-21708-5","volume-title":"Combinatorial Optimization: Theory and Algorithms","author":"B. Korte","year":"2000","unstructured":"Korte, B., Vygen, J.: Combinatorial Optimization: Theory and Algorithms. Springer, Heidelberg (2000)"},{"key":"30_CR11","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1112\/jlms\/s2-31.1.17","volume":"31","author":"S..J.A. Nash-Williams","year":"1985","unstructured":"Nash-Williams, S.J.A.: Connected detachments of graphs and generalised Euler trails. J. Lond. Math. Soc.\u00a031, 17\u201329 (1985)","journal-title":"J. Lond. Math. Soc."}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11809678_30.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:26:36Z","timestamp":1619508396000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11809678_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540369257","9783540369264"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/11809678_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}