{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,2,2]],"date-time":"2023-02-02T16:57:46Z","timestamp":1675357066461},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2016,3,10]],"date-time":"2016-03-10T00:00:00Z","timestamp":1457568000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"KAKENHI","award":["24106002","24700004"],"award-info":[{"award-number":["24106002","24700004"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2017,4]]},"DOI":"10.1007\/s00453-016-0142-y","type":"journal-article","created":{"date-parts":[[2016,3,10]],"date-time":"2016-03-10T14:03:20Z","timestamp":1457618600000},"page":"1128-1142","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Finding a Shortest Non-zero Path in Group-Labeled Graphs via Permanent Computation"],"prefix":"10.1007","volume":"77","author":[{"given":"Yusuke","family":"Kobayashi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sho","family":"Toyooka","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,3,10]]},"reference":[{"key":"142_CR1","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1090\/qam\/102435","volume":"16","author":"RE Bellman","year":"1958","unstructured":"Bellman, R.E.: On a routing problem. Q. Appl. Math. 16, 87\u201390 (1958)","journal-title":"Q. Appl. Math."},{"key":"142_CR2","doi-asserted-by":"crossref","unstructured":"Bj\u00f6rklund, A., Husfeldt, T.: Shortest two disjoint paths in polynomial time. In: Proceedings of the 41st International Colloquium on Automata, Languages and Programming, Part I. LNCS 8572, pp. 211\u2013222 (2014)","DOI":"10.1007\/978-3-662-43948-7_18"},{"key":"142_CR3","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"EW Dijkstra","year":"1959","unstructured":"Dijkstra, E.W.: A note on two problems in connexion with graphs. Numer. Math. 1, 269\u2013271 (1959)","journal-title":"Numer. Math."},{"key":"142_CR4","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1007\/s004930070031","volume":"20","author":"JF Geelen","year":"2000","unstructured":"Geelen, J.F.: An algebraic matching algorithm. Combinatorica 20, 61\u201370 (2000)","journal-title":"Combinatorica"},{"key":"142_CR5","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1016\/0012-365X(77)90131-5","volume":"18","author":"JL Gross","year":"1977","unstructured":"Gross, J.L., Tucker, T.W.: Generating all graph coverings by permutation voltage assignments. Discrete Math. 18, 273\u2013283 (1977)","journal-title":"Discrete Math."},{"key":"142_CR6","volume-title":"Topological Graph Theory","author":"JL Gross","year":"1987","unstructured":"Gross, J.L., Tucker, T.W.: Topological Graph Theory. Wiley, London (1987)"},{"key":"142_CR7","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/0167-6377(81)90020-1","volume":"1","author":"M Gr\u00f6tschel","year":"1981","unstructured":"Gr\u00f6tschel, M., Pulleyblank, W.R.: Weakly bipartite graphs and the max-cut problem. Oper. Res. Lett. 1, 23\u201327 (1981)","journal-title":"Oper. Res. Lett."},{"key":"142_CR8","unstructured":"T. Huynh, The linkage problem for group-labelled graphs, Ph.D. Thesis, Department of Combinatorics and Optimization, University of Waterloo, Ontario (2009)"},{"key":"142_CR9","doi-asserted-by":"crossref","first-page":"507","DOI":"10.1002\/net.3230140403","volume":"14","author":"AS LaPaugh","year":"1984","unstructured":"LaPaugh, A.S., Papadimitriou, C.H.: The even-path problem for graphs and digraphs. Networks 14, 507\u2013513 (1984)","journal-title":"Networks"},{"key":"142_CR10","volume-title":"On determinants, Matchings, and Random Algorithms, Fundamentals of Computation Theory, FCT \u201979","author":"L Lov\u00e1sz","year":"1979","unstructured":"Lov\u00e1sz, L.: On determinants, Matchings, and Random Algorithms, Fundamentals of Computation Theory, FCT \u201979. Akademie-Verlag, Berlin (1979)"},{"key":"142_CR11","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1007\/BF02579206","volume":"7","author":"K Mulmuley","year":"1987","unstructured":"Mulmuley, K., Vazirani, U.V., Vazirani, V.V.: Matching is as easy as matrix inversion. Combinatorica 7, 105\u2013113 (1987)","journal-title":"Combinatorica"},{"key":"142_CR12","volume-title":"Combinatorial Optimization: Polyhedra and Efficiency","author":"A Schrijver","year":"2003","unstructured":"Schrijver, A.: Combinatorial Optimization: Polyhedra and Efficiency. Springer, Berlin (2003)"},{"key":"142_CR13","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1112\/jlms\/s1-22.2.107","volume":"22","author":"WT Tutte","year":"1947","unstructured":"Tutte, W.T.: The factorization of linear graphs. J. Lond. Math. Soc. 22, 107\u2013111 (1947)","journal-title":"J. Lond. Math. Soc."},{"key":"142_CR14","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/0304-3975(79)90044-6","volume":"8","author":"LG Valiant","year":"1979","unstructured":"Valiant, L.G.: The complexity of computing the permanent. Theor. Comput. Sci. 8, 189\u2013201 (1979)","journal-title":"Theor. Comput. Sci."},{"key":"142_CR15","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1016\/0095-8956(89)90063-4","volume":"47","author":"T Zaslavsky","year":"1989","unstructured":"Zaslavsky, T.: Biased graph. I. bias, balance, and gains. J. Comb. Theory Ser. B 47, 32\u201352 (1989)","journal-title":"J. Comb. Theory Ser. B"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-016-0142-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-016-0142-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-016-0142-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-016-0142-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T23:47:24Z","timestamp":1559087244000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-016-0142-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,3,10]]},"references-count":15,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2017,4]]}},"alternative-id":["142"],"URL":"https:\/\/doi.org\/10.1007\/s00453-016-0142-y","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,3,10]]}}}