{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,30]],"date-time":"2025-04-30T04:20:55Z","timestamp":1745986855561,"version":"3.40.4"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642360640"},{"type":"electronic","value":"9783642360657"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-36065-7_17","type":"book-chapter","created":{"date-parts":[[2013,1,21]],"date-time":"2013-01-21T16:36:53Z","timestamp":1358786213000},"page":"170-181","source":"Crossref","is-referenced-by-count":0,"title":["Shared-Memory Parallel Frontier-Based Search"],"prefix":"10.1007","author":[{"given":"Shogo","family":"Takeuchi","sequence":"first","affiliation":[]},{"given":"Jun","family":"Kawahara","sequence":"additional","affiliation":[]},{"given":"Akihiro","family":"Kishimoto","sequence":"additional","affiliation":[]},{"given":"Shin-ichi","family":"Minato","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"17_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"916","DOI":"10.1007\/BFb0031663","volume-title":"High-Performance Computing and Networking","author":"F. Bianchi","year":"1997","unstructured":"Bianchi, F., Corno, F., Rebaudengo, M., Reorda, M.S., Ansaloni, R.: Boolean Function Manipulation on a Parallel System Using BDDs. In: Hertzberger, B., Sloot, P.M.A. (eds.) HPCN-Europe 1997. LNCS, vol.\u00a01225, pp. 916\u2013928. Springer, Heidelberg (1997)"},{"issue":"8","key":"17_CR2","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":"17_CR3","doi-asserted-by":"crossref","unstructured":"Chen, J.-S., Banerjee, P.: Parallel constuction algorithms for BDDs. In: Proceedings of the 1999 IEEE International Symposium on Circuits and Systems, ISCAS 1999, vol.\u00a01, pp. 318\u2013322 (1999)","DOI":"10.1109\/ISCAS.1999.777867"},{"issue":"3","key":"17_CR4","doi-asserted-by":"publisher","first-page":"506","DOI":"10.1109\/TR.2007.898572","volume":"56","author":"G. Hardy","year":"2007","unstructured":"Hardy, G., Lucet, C., Limnios, N.: K-terminal network reliability measures with binary decision diagrams. IEEE Transactions on Reliability\u00a056(3), 506\u2013515 (2007)","journal-title":"IEEE Transactions on Reliability"},{"key":"17_CR5","unstructured":"Inoue, T., Takano, K., Watanabe, T., Kawahara, J., Yoshinaka, R., Kishimoto, A., Tsuda, K., Minato, S., Hayashi, Y.: Finding all configurations satisfying operational constraints in delivery networks by ZDDs. In: Proceedings of the Institute of Electrical Engineers of Japan National Conference (2012) (in Japanese)"},{"key":"17_CR6","doi-asserted-by":"crossref","unstructured":"Karp, R., Zhang, Y.: A randomized parallel branch-and-bound procedure. In: Proceedings of the 20th ACM Symposium on Theory of Computing, STOC, pp. 290\u2013300 (1988)","DOI":"10.1145\/62212.62240"},{"issue":"3","key":"17_CR7","doi-asserted-by":"publisher","first-page":"765","DOI":"10.1145\/174130.174145","volume":"40","author":"R. Karp","year":"1993","unstructured":"Karp, R., Zhang, Y.: Randomized parallel algorithms for backtrack search and branch-and-bound computation. Journal of the Association for Computing Machinery\u00a040(3), 765\u2013789 (1993)","journal-title":"Journal of the Association for Computing Machinery"},{"key":"17_CR8","unstructured":"Knuth, D.E.: The Art of Computer Programming, 1st edn. Combinatorial Algorithms, Part 1, vol.\u00a04A. Addison-Wesley Professional (March 2011)"},{"key":"17_CR9","unstructured":"Kumar, V., Ramesh, K., Rao, V.N.: Parallel best-first search of state-space graphs: A summary of results. In: Proceedings of the 10th National Conference Artificial Intelligence, AAAI, pp. 122\u2013127. Press (1988)"},{"key":"17_CR10","doi-asserted-by":"crossref","unstructured":"Minato, S.: Zero-suppressed BDDs for set manipulation in combinatorial problems. In: Proceedings of the 30th ACM\/IEEE Design Automation Conference, pp. 272\u2013277 (1993)","DOI":"10.1145\/157485.164890"},{"key":"17_CR11","doi-asserted-by":"crossref","unstructured":"Ochi, H., Yasuoka, K., Yajima, S.: Breadth-first manipulation of SBDD of boolean functions for vector processing. In: Procedings of the 28th ACM\/IEEE Design Automation Conference, pp. 413\u2013416 (1991)","DOI":"10.1145\/127601.127704"},{"key":"17_CR12","doi-asserted-by":"crossref","unstructured":"Ranjan, R.K., Sanghavi, J.V., Brayton, R.K., Sangiovanni-Vincentelli, A.: Binary decision diagrams on network of workstations. In: IEEE International Conference on Computer Design: VLSI in Computers and Processors, ICCD 1996, pp. 358\u2013364 (1996)","DOI":"10.1109\/ICCD.1996.563579"},{"key":"17_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1007\/BFb0015427","volume-title":"Algorithms and Computations","author":"K. Sekine","year":"1995","unstructured":"Sekine, K., Imai, H., Tani, S.: Computing the Tutte Polynomial of a Graph of Moderate Size. In: Staples, J., Katoh, N., Eades, P., Moffat, A. (eds.) ISAAC 1995. LNCS, vol.\u00a01004, pp. 224\u2013233. Springer, Heidelberg (1995)"},{"key":"17_CR14","doi-asserted-by":"publisher","first-page":"641","DOI":"10.1109\/DAC.1996.545653","volume-title":"Proceedings of the 33rd Annual Design Automation Conference, DAC 1996","author":"T. Stornetta","year":"1996","unstructured":"Stornetta, T., Brewer, F.: Implementation of an efficient parallel BDD package. In: Proceedings of the 33rd Annual Design Automation Conference, DAC 1996, pp. 641\u2013644. ACM, New York (1996)"},{"key":"17_CR15","doi-asserted-by":"crossref","unstructured":"Yang, B., O\u2019Hallaron, D.R.: Parallel breadth-first BDD construction. In: Proceedings of the 9th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, pp. 145\u2013156. ACM Press (1997)","DOI":"10.1145\/263767.263784"},{"issue":"2","key":"17_CR16","doi-asserted-by":"publisher","first-page":"176","DOI":"10.3390\/a5020176","volume":"5","author":"R. Yoshinaka","year":"2012","unstructured":"Yoshinaka, R., Saitoh, T., Kawahara, J., Tsuruma, K., Iwashita, H., Minato, S.: Finding all solutions and instances of numberlink and slitherlink by ZDDs. Algorithms\u00a05(2), 176\u2013213 (2012)","journal-title":"Algorithms"}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-36065-7_17.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,29]],"date-time":"2025-04-29T17:54:13Z","timestamp":1745949253000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-36065-7_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642360640","9783642360657"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-36065-7_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}