{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,20]],"date-time":"2025-05-20T04:12:28Z","timestamp":1747714348798,"version":"3.40.5"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319156118"},{"type":"electronic","value":"9783319156125"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-15612-5_15","type":"book-chapter","created":{"date-parts":[[2015,2,23]],"date-time":"2015-02-23T04:05:18Z","timestamp":1424664318000},"page":"161-174","source":"Crossref","is-referenced-by-count":0,"title":["Enumerating Eulerian Trails via Hamiltonian Path Enumeration"],"prefix":"10.1007","author":[{"given":"Hiroyuki","family":"Hanada","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shuhei","family":"Denzumi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuma","family":"Inoue","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hiroshi","family":"Aoki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Norihito","family":"Yasuda","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shogo","family":"Takeuchi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shin-ichi","family":"Minato","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"15_CR1","unstructured":"Wilson, R.J.: Introduction to Graph Theory, 4th edn. Pearson Education (1996)"},{"key":"15_CR2","doi-asserted-by":"crossref","unstructured":"Harary, F.: Graph Theory, 1st edn. Addison-Wesley (1969)","DOI":"10.21236\/AD0705364"},{"key":"15_CR3","unstructured":"Mihail, M., Winkler, P.: On the number of Eulerian orientations of a graph. In: Proceedings of the Third Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1992, pp. 138\u2013145 (1992)"},{"issue":"2","key":"15_CR4","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1016\/j.jda.2008.09.006","volume":"7","author":"P. Creed","year":"2009","unstructured":"Creed, P.: Sampling Eulerian orientations of triangular lattice graphs. Journal of Discrete Algorithms\u00a07(2), 168\u2013180 (2009)","journal-title":"Journal of Discrete Algorithms"},{"issue":"3","key":"15_CR5","doi-asserted-by":"publisher","first-page":"588","DOI":"10.1007\/s00453-010-9463-4","volume":"63","author":"Q. Ge","year":"2012","unstructured":"Ge, Q., \u0160tefankovi\u010d, D.: The complexity of counting Eulerian tours in 4-regular graphs. Algorithmica\u00a063(3), 588\u2013601 (2012)","journal-title":"Algorithmica"},{"issue":"12","key":"15_CR6","doi-asserted-by":"publisher","first-page":"1329","DOI":"10.1016\/S0031-8914(63)80241-4","volume":"29","author":"P.W. Kasteleyn","year":"1963","unstructured":"Kasteleyn, P.W.: A soluble self-avoiding walk problem. Physica\u00a029(12), 1329\u20131337 (1963)","journal-title":"Physica"},{"issue":"4","key":"15_CR7","doi-asserted-by":"publisher","first-page":"576","DOI":"10.1145\/321850.321854","volume":"21","author":"F. Rubin","year":"1974","unstructured":"Rubin, F.: A search procedure for Hamilton paths and circuits. Journal of the ACM\u00a021(4), 576\u2013580 (1974)","journal-title":"Journal of the ACM"},{"issue":"1","key":"15_CR8","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1137\/0205007","volume":"5","author":"P. Mateti","year":"1976","unstructured":"Mateti, P., Deo, N.: On algorithms for enumerating all circuits of a graph. SIAM Journal on Computing\u00a05(1), 90\u201399 (1976)","journal-title":"SIAM Journal on Computing"},{"issue":"6","key":"15_CR9","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1016\/j.trb.2004.07.004","volume":"39","author":"N.J. Zijpp van der","year":"2005","unstructured":"van der Zijpp, N.J., Catalano, S.F.: Path enumeration by finding the constrained k-shortest paths. Transportation Research Part B: Methodological\u00a039(6), 545\u2013563 (2005)","journal-title":"Transportation Research Part B: Methodological"},{"key":"15_CR10","doi-asserted-by":"crossref","unstructured":"Liu, H., Wang, J.: A new way to enumerate cycles in graph. In: International Conference on Internet and Web Applications and Services\/Advanced International Conference on Telecommunications, p.\u00a057 (2006)","DOI":"10.1109\/AICT-ICIW.2006.22"},{"issue":"2","key":"15_CR11","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1007\/s100090100038","volume":"3","author":"S.-i. Minato","year":"2001","unstructured":"Minato, S.-i.: Zero-suppressed BDDs and their applications. International Journal on Software Tools for Technology Transfer\u00a03(2), 156\u2013170 (2001)","journal-title":"International Journal on Software Tools for Technology Transfer"},{"key":"15_CR12","doi-asserted-by":"crossref","unstructured":"Diestel, R.: Graph Theory, 4th edn. Springer (2010)","DOI":"10.1007\/978-3-642-14279-6"},{"key":"15_CR13","doi-asserted-by":"publisher","first-page":"559","DOI":"10.1090\/S0002-9947-1968-0231740-1","volume":"134","author":"G. Chartrand","year":"1968","unstructured":"Chartrand, G.: On Hamiltonian line-graphs. Transactions of the American Mathematical Society\u00a0134, 559\u2013566 (1968)","journal-title":"Transactions of the American Mathematical Society"},{"key":"15_CR14","doi-asserted-by":"publisher","first-page":"701","DOI":"10.4153\/CMB-1965-051-3","volume":"8","author":"F. Harary","year":"1965","unstructured":"Harary, F., Nash-Williams, C.S.J.A.: On Eulerian and Hamiltonian graphs and line graphs. Canadian Mathematical Bulletin\u00a08, 701\u2013709 (1965)","journal-title":"Canadian Mathematical Bulletin"},{"key":"15_CR15","unstructured":"Knuth, D.E.: 7.1.4 Binary Decision Diagrams. In: Combinatorial Algorithms, vol. 4A. The Art of Computer Programming, vol.\u00a04A. Pearson Education (2011)"},{"key":"15_CR16","unstructured":"Knuth, D.E.: Don Knuth\u2019s home page, http:\/\/www-cs-staff.stanford.edu\/~uno\/"},{"issue":"8","key":"15_CR17","doi-asserted-by":"publisher","first-page":"677","DOI":"10.1109\/TC.1986.1676819","volume":"C-35","author":"R.E. Bryant","year":"1986","unstructured":"Bryant, R.E.: Graph-based algorithms for boolean function manipulation. IEEE Transactions on Computers\u00a0C-35(8), 677\u2013691 (1986)","journal-title":"IEEE Transactions on Computers"},{"key":"15_CR18","unstructured":"Inoue, T., Iwashita, H., Kawahara, J., Minato, S.: Graphillion: Software library designed for very large sets of graphs in python. Technical Report TCS-TR-A-13-65, Division of Computer Science, Hokkaido University (2013)"},{"issue":"2","key":"15_CR19","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1023\/A:1022420103267","volume":"1","author":"N. Elkies","year":"1992","unstructured":"Elkies, N., Kuperberg, G., Larsen, M., Propp, J.: Alternating-sign matrices and domino tilings (part I). Journal of Algebraic Combinatorics\u00a01(2), 111\u2013132 (1992)","journal-title":"Journal of Algebraic Combinatorics"}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-15612-5_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,19]],"date-time":"2025-05-19T21:48:28Z","timestamp":1747691308000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-15612-5_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319156118","9783319156125"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-15612-5_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}