{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:36:49Z","timestamp":1725665809279},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642283314"},{"type":"electronic","value":"9783642283321"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"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":[[2012]]},"DOI":"10.1007\/978-3-642-28332-1_13","type":"book-chapter","created":{"date-parts":[[2012,2,29]],"date-time":"2012-02-29T14:45:36Z","timestamp":1330526736000},"page":"143-154","source":"Crossref","is-referenced-by-count":3,"title":["An Efficient Implicit OBDD-Based Algorithm for Maximal Matchings"],"prefix":"10.1007","author":[{"given":"Beate","family":"Bollig","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tobias","family":"Pr\u00f6ger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"13_CR1","doi-asserted-by":"publisher","first-page":"924","DOI":"10.1016\/j.ipl.2010.07.022","volume":"110","author":"B. Bollig","year":"2010","unstructured":"Bollig, B.: Exponential space complexity for OBDD-based reachability analysis. Information Processing Letters\u00a0110, 924\u2013927 (2010)","journal-title":"Information Processing Letters"},{"key":"13_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1007\/978-3-642-15155-2_18","volume-title":"Mathematical Foundations of Computer Science 2010","author":"B. Bollig","year":"2010","unstructured":"Bollig, B.: Exponential Space Complexity for Symbolic Maximum Flow Algorithms in 0-1 Networks. In: Hlin\u011bn\u00fd, P., Ku\u010dera, A. (eds.) MFCS 2010. LNCS, vol.\u00a06281, pp. 186\u2013197. Springer, Heidelberg (2010)"},{"key":"13_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1007\/978-3-642-17461-2_2","volume-title":"Combinatorial Optimization and Applications","author":"B. Bollig","year":"2010","unstructured":"Bollig, B.: On Symbolic OBDD-Based Algorithms for the Minimum Spanning Tree Problem. In: Wu, W., Daescu, O. (eds.) COCOA 2010, Part II. LNCS, vol.\u00a06509, pp. 16\u201330. Springer, Heidelberg (2010)"},{"key":"13_CR4","doi-asserted-by":"crossref","unstructured":"Bollig, B., Pr\u00f6ger, T.: An efficient implicit OBDD-based algorithm for maximal matchings (2011), \n                    \n                      http:\/\/ls2-www.cs.tu-dortmund.de\/~bollig\/maxMatching.pdf","DOI":"10.1007\/978-3-642-28332-1_13"},{"issue":"8","key":"13_CR5","doi-asserted-by":"publisher","first-page":"677","DOI":"10.1109\/TC.1986.1676819","volume":"35","author":"R.E. Bryant","year":"1986","unstructured":"Bryant, R.E.: Graph-based algorithms for boolean function manipulation. IEEE Trans. Computers\u00a035(8), 677\u2013691 (1986)","journal-title":"IEEE Trans. Computers"},{"key":"13_CR6","unstructured":"Gentilini, R., Piazza, C., Policriti, A.: Computing strongly connected components in a linear number of symbolic steps. In: Proc. of SODA, pp. 573\u2013582 (2003)"},{"issue":"1","key":"13_CR7","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1007\/s00453-007-9079-5","volume":"50","author":"R. Gentilini","year":"2008","unstructured":"Gentilini, R., Piazza, C., Policriti, A.: Symbolic graphs: linear solutions to connectivity related problems. Algorithmica\u00a050(1), 120\u2013158 (2008)","journal-title":"Algorithmica"},{"issue":"2","key":"13_CR8","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1006\/jagm.1993.1009","volume":"14","author":"A.V. Goldberg","year":"1993","unstructured":"Goldberg, A.V., Plotkin, S.K., Vaidya, P.M.: Sublinear time parallel algorithms for matching and related problems. Journal of Algorithms\u00a014(2), 180\u2013213 (1993)","journal-title":"Journal of Algorithms"},{"key":"13_CR9","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1023\/A:1008651924240","volume":"10","author":"G.D. Hachtel","year":"1997","unstructured":"Hachtel, G.D., Somenzi, F.: A symbolic algorithm for maximum flow in 0\u2009\u2212\u20091 networks. Formal Methods in System Design\u00a010, 207\u2013219 (1997)","journal-title":"Formal Methods in System Design"},{"key":"13_CR10","unstructured":"J\u00e1j\u00e1, J.: An introduction to parallel algorithms. Addison-Wesley Publishing Company (1992)"},{"issue":"4","key":"13_CR11","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/0020-0190(94)90130-9","volume":"52","author":"P. Kelsen","year":"1994","unstructured":"Kelsen, P.: An optimal parallel algorithm for maximal matching. Information Processing Letters\u00a052(4), 223\u2013228 (1994)","journal-title":"Information Processing Letters"},{"key":"13_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/978-3-540-24618-3_26","volume-title":"SOFSEM 2004: Theory and Practice of Computer Science","author":"D. Sawitzki","year":"2004","unstructured":"Sawitzki, D.: Implicit Flow Maximization by Iterative Squaring. In: Van Emde Boas, P., Pokorn\u00fd, J., Bielikov\u00e1, M., \u0160tuller, J. (eds.) SOFSEM 2004. LNCS, vol.\u00a02932, pp. 301\u2013313. Springer, Heidelberg (2004)"},{"key":"13_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1007\/11611257_45","volume-title":"SOFSEM 2006: Theory and Practice of Computer Science","author":"D. Sawitzki","year":"2006","unstructured":"Sawitzki, D.: The Complexity of Problems on Implicitly Represented Inputs. In: Wiedermann, J., Tel, G., Pokorn\u00fd, J., Bielikov\u00e1, M., \u0160tuller, J. (eds.) SOFSEM 2006. LNCS, vol.\u00a03831, pp. 471\u2013482. Springer, Heidelberg (2006)"},{"key":"13_CR14","unstructured":"Sawitzki, D.: Implicit simulation of FNC algorithms. Tech. Rep. TR07-028, ECCC Report (2007)"},{"key":"13_CR15","doi-asserted-by":"crossref","unstructured":"Wegener, I.: Branching programs and binary decision diagrams: theory and applications. SIAM (2000)","DOI":"10.1137\/1.9780898719789"},{"issue":"1","key":"13_CR16","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/j.jda.2005.01.008","volume":"4","author":"P. Woelfel","year":"2006","unstructured":"Woelfel, P.: Symbolic topological sorting with OBDDs. J. Discrete Algorithms\u00a04(1), 51\u201371 (2006)","journal-title":"J. Discrete Algorithms"}],"container-title":["Lecture Notes in Computer Science","Language and Automata Theory and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-28332-1_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T08:31:32Z","timestamp":1556440292000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-28332-1_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642283314","9783642283321"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-28332-1_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}