{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,30]],"date-time":"2025-10-30T22:18:53Z","timestamp":1761862733435},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2008,4,1]],"date-time":"2008-04-01T00:00:00Z","timestamp":1207008000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2009,2]]},"DOI":"10.1007\/s00453-008-9184-0","type":"journal-article","created":{"date-parts":[[2008,3,31]],"date-time":"2008-03-31T13:15:43Z","timestamp":1206969343000},"page":"207-224","source":"Crossref","is-referenced-by-count":19,"title":["A Detachment Algorithm for Inferring a Graph from\u00a0Path Frequency"],"prefix":"10.1007","volume":"53","author":[{"given":"Hiroshi","family":"Nagamochi","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2008,4,1]]},"reference":[{"key":"9184_CR1","doi-asserted-by":"crossref","unstructured":"Akutsu, T., Fukagawa, D.: Inferring a graph from path frequency. In: Proceedings of the 16th Annual Symposium on Combinatorial Pattern Matching. Lecture Notes in Computer Science, vol.\u00a03537, pp.\u00a0371\u2013382 (2005)","DOI":"10.1007\/11496656_32"},{"key":"9184_CR2","unstructured":"Akutsu, T., Fukagawa, D.: On inference of a chemical structure from path frequency. In: Proceedings of the 2005 International Joint Conference of InCoB, AASBi and KSBI, pp.\u00a096\u2013100 (2005)"},{"key":"9184_CR3","first-page":"449","volume":"16","author":"G.H. Bakir","year":"2004","unstructured":"Bakir, G.H., Weston, J., Sch\u00f6lkopf, B.: Learning to find pre-images. Adv. Neural Inf. Proc. Syst. 16, 449\u2013456 (2004)","journal-title":"Adv. Neural Inf. Proc. Syst."},{"key":"9184_CR4","doi-asserted-by":"crossref","unstructured":"Bakir, G.H., Zien, A., Tsuda, K.: Learning to find graph pre-images. In: Proceedings of the 26th DAGM Symposium, Lecture Notes in Computer Science, vol.\u00a03175, pp.\u00a0253\u2013261 (2004)","DOI":"10.1007\/978-3-540-28649-3_31"},{"key":"9184_CR5","doi-asserted-by":"crossref","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.\u00a0Graph Theory 43, 67\u201377 (2003)","journal-title":"J.\u00a0Graph Theory"},{"key":"9184_CR6","volume-title":"Combinatorial Optimization","author":"W.J. Cook","year":"1998","unstructured":"Cook, W.J., Cunningham, W.H., Pulleyblank, W.R., Schrijver, A.: Combinatorial Optimization. Wiley\u2013Interscience, New York (1998)"},{"key":"9184_CR7","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511801389","volume-title":"An Introduction to Support Vector Machines and Other Kernel-based Learning Methods","author":"N. Cristianini","year":"2000","unstructured":"Cristianini, N., Shawe-Taylor, J.: An Introduction to Support Vector Machines and Other Kernel-based Learning Methods. Cambridge University Press, Cambridge (2000)"},{"key":"9184_CR8","doi-asserted-by":"crossref","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. Comput. 15, 948\u2013957 (1986)","journal-title":"SIAM J. Comput."},{"key":"9184_CR9","first-page":"69","volume-title":"Combinatorial Structures and Their Applications","author":"J. Edmonds","year":"1970","unstructured":"Edmonds, J.: Submodular functions, matroids, and certain polyhedra. In: Guy, R.K., Hanani, H., Sauer, N., Sch\u00f6nheim, J. (eds.) Combinatorial Structures and Their Applications, pp.\u00a069\u201387. Gordon & Breach, New York (1970)"},{"key":"9184_CR10","doi-asserted-by":"crossref","first-page":"328","DOI":"10.1016\/0196-6774(81)90032-8","volume":"2","author":"A. Frank","year":"1981","unstructured":"Frank, A.: A weighted matroid intersection algorithm. J.\u00a0Algorithms 2, 328\u2013336 (1981)","journal-title":"J.\u00a0Algorithms"},{"key":"9184_CR11","doi-asserted-by":"crossref","unstructured":"Fukunaga, T., Nagamochi, H.: Some theorems on detachments preserving local-edge-connectivity. In: Proceedings of the fifth CRACOW Conference on Graph Theory. Electronic Notes in Discrete Mathematics, vol.\u00a024, pp.\u00a0173\u2013180 (2006)","DOI":"10.1016\/j.endm.2006.06.041"},{"key":"9184_CR12","doi-asserted-by":"crossref","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.\u00a0Comb. Theory B 87, 17\u201337 (2003)","journal-title":"J.\u00a0Comb. Theory B"},{"key":"9184_CR13","unstructured":"Jansson, J., Sadakane, K.: Private communication"},{"key":"9184_CR14","unstructured":"Kashima, H., Tsuda, K., Inokuchi, A.: Marginalized kernels between labeled graphs. In: Proceedings of the 20th International Conference on Machine Learning, pp.\u00a0321\u2013328 (2003)"},{"key":"9184_CR15","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, Berlin (2000)"},{"key":"9184_CR16","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1007\/BF01681329","volume":"9","author":"E.L. Lawler","year":"1975","unstructured":"Lawler, E.L.: Matroid intersection algorithms. Math. Program. 9, 31\u201356 (1975)","journal-title":"Math. Program."},{"key":"9184_CR17","doi-asserted-by":"crossref","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 generalized Euler trails. J.\u00a0Lond. Math. Soc. 31, 17\u201329 (1985)","journal-title":"J.\u00a0Lond. Math. Soc."},{"key":"9184_CR18","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1007\/BF02546665","volume":"68","author":"G. P\u00f3lya","year":"1937","unstructured":"P\u00f3lya, G.: Kombinatorische Anzahlbestimmungen fur Gruppen, Graphen und chemische Verbindungen. Acta Math. 68, 145\u2013254 (1937)","journal-title":"Acta Math."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-008-9184-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-008-9184-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-008-9184-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T09:45:02Z","timestamp":1559123102000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-008-9184-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,4,1]]},"references-count":18,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2009,2]]}},"alternative-id":["9184"],"URL":"https:\/\/doi.org\/10.1007\/s00453-008-9184-0","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,4,1]]}}}