{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T15:59:20Z","timestamp":1742918360313,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642299513"},{"type":"electronic","value":"9783642299520"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-29952-0_45","type":"book-chapter","created":{"date-parts":[[2012,5,3]],"date-time":"2012-05-03T06:14:09Z","timestamp":1336025649000},"page":"473-486","source":"Crossref","is-referenced-by-count":2,"title":["Implicit Computation of Maximum Bipartite Matchings by Sublinear Functional Operations"],"prefix":"10.1007","author":[{"given":"Beate","family":"Bollig","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marc","family":"Gill\u00e9","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tobias","family":"Pr\u00f6ger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"45_CR1","volume-title":"Network Flows: Theory, Algorithms, and Applications","author":"R.K. Ahuja","year":"1993","unstructured":"Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory, Algorithms, and Applications. Prentice Hall, Englewood Cliffs (1993)"},{"issue":"9","key":"45_CR2","doi-asserted-by":"publisher","first-page":"842","DOI":"10.1073\/pnas.43.9.842","volume":"43","author":"C. Berge","year":"1957","unstructured":"Berge, C.: Two theorems in graph theory. Proc. of National Academy of Science of the USA\u00a043(9), 842\u2013844 (1957)","journal-title":"Proc. of National Academy of Science of the USA"},{"key":"45_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/3-540-40922-X_4","volume-title":"Formal Methods in Computer-Aided Design","author":"R. Bloem","year":"2000","unstructured":"Bloem, R., Gabow, H.N., Somenzi, F.: An Algorithm for Strongly Connected Component Analysis in n logn Symbolic Steps. In: Johnson, S.D., Hunt Jr., W.A. (eds.) FMCAD 2000. LNCS, vol.\u00a01954, pp. 37\u201354. Springer, Heidelberg (2000)"},{"key":"45_CR4","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":"45_CR5","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":"45_CR6","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":"45_CR7","series-title":"IFIP AICT","doi-asserted-by":"publisher","first-page":"286","DOI":"10.1007\/978-3-642-15240-5_21","volume-title":"Theoretical Computer Science","author":"B. Bollig","year":"2010","unstructured":"Bollig, B.: On Symbolic Representations of Maximum Matchings and (Un)directed Graphs. In: Calude, C.S., Sassone, V. (eds.) TCS 2010. IFIP AICT, vol.\u00a0323, pp. 286\u2013300. Springer, Heidelberg (2010)"},{"key":"45_CR8","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1016\/0020-0190(96)00119-6","volume":"59","author":"B. Bollig","year":"1996","unstructured":"Bollig, B., L\u00f6bbing, M., Wegener, I.: On the effect of local changes in the variable ordering of ordered decision diagrams. Information Processing Letters\u00a059, 233\u2013239 (1996)","journal-title":"Information Processing Letters"},{"key":"45_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/978-3-642-28332-1_13","volume-title":"Language and Automata Theory and Applications","author":"B. Bollig","year":"2012","unstructured":"Bollig, B., Pr\u00f6ger, T.: An Efficient Implicit OBDD-Based Algorithm for Maximal Matchings. In: Dediu, A.-H., Mart\u00edn-Vide, C. (eds.) LATA 2012. LNCS, vol.\u00a07183, pp. 143\u2013154. Springer, Heidelberg (2012)"},{"key":"45_CR10","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. on Computers\u00a035, 677\u2013691 (1986)","journal-title":"IEEE Trans. on Computers"},{"key":"45_CR11","doi-asserted-by":"crossref","unstructured":"Charles, D.X., Chickering, M., Devanur, N.R., Jain, K., Sanghi, M.: Fast algorithms for finding matchings in lopsided bipartite graphs with applications to display ads. In: Proc. of ACM Conference on Electronic Commerce 2010, pp. 121\u2013128 (2010)","DOI":"10.1145\/1807342.1807362"},{"key":"45_CR12","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1145\/297096.297140","volume":"3","author":"B.V. Cherkassky","year":"1998","unstructured":"Cherkassky, B.V., Goldberg, A.V., Martin, P., Setubal, J.C., Stolfi, J.: Augment or push: a computational study of bipartite matching and unit-capacity flow algorithms. ACM Journal of Experimental Algorithmics\u00a03, 8 (1998)","journal-title":"ACM Journal of Experimental Algorithmics"},{"key":"45_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1007\/BFb0028563","volume-title":"STACS 98","author":"J. Feigenbaum","year":"1998","unstructured":"Feigenbaum, J., Kannan, S., Vardi, M.V., Viswanathan, M.: Complexity of Problems on Graphs Represented as OBDDs. In: Meinel, C., Morvan, M. (eds.) STACS 1998. LNCS, vol.\u00a01373, pp. 216\u2013226. Springer, Heidelberg (1998)"},{"key":"45_CR14","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. ACM Press (2003)"},{"key":"45_CR15","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, 120\u2013158 (2008)","journal-title":"Algorithmica"},{"issue":"1","key":"45_CR16","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1137\/0221011","volume":"21","author":"A.V. Goldberg","year":"1992","unstructured":"Goldberg, A.V., Plotkin, S.A., Shmoys, D.B., Tardos, E.: Using interior-point methods for fast parallel algorithms for bipartite matching and related problems. SIAM Journal on Computing\u00a021(1), 140\u2013150 (1992)","journal-title":"SIAM Journal on Computing"},{"issue":"2","key":"45_CR17","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":"45_CR18","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-1 networks. Formal Methods in System Design\u00a010, 207\u2013219 (1997)","journal-title":"Formal Methods in System Design"},{"issue":"4","key":"45_CR19","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1137\/0202019","volume":"2","author":"J.E. Hopcroft","year":"1973","unstructured":"Hopcroft, J.E., Karp, R.M.: An n\n                           5\/2 algorithm for maximum matchings in bipartite graphs. SIAM Journal on Computing\u00a02(4), 225\u2013231 (1973)","journal-title":"SIAM Journal on Computing"},{"key":"45_CR20","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/0020-0190(89)90064-1","volume":"32","author":"K. Iwano","year":"1989","unstructured":"Iwano, K.: An improvement of Goldberg, Plotkin, and Vaidya\u2019s maximal node-disjoint paths algorithm. Information Processing Letters\u00a032, 25\u201327 (1989)","journal-title":"Information Processing Letters"},{"key":"45_CR21","doi-asserted-by":"publisher","first-page":"1609","DOI":"10.1016\/S0167-8191(00)00049-1","volume":"26","author":"B. Monien","year":"2000","unstructured":"Monien, B., Preis, R., Diekmann, R.: Quality matching and local improvement for multilevel graph-partitioning. Parallel Computing\u00a026, 1609\u20131634 (2000)","journal-title":"Parallel Computing"},{"key":"45_CR22","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1007\/s004539910008","volume":"26","author":"R.H. M\u00f6hring","year":"2000","unstructured":"M\u00f6hring, R.H., M\u00fcller-Hannemann, M.: Complexity and modeling aspects of mesh refinement into quadrilaterals. Algorithmica\u00a026, 148\u2013172 (2000)","journal-title":"Algorithmica"},{"key":"45_CR23","doi-asserted-by":"crossref","unstructured":"Negruseri, C.S., Pasoi, M.B., Stanley, B., Stein, C., Strat, C.G.: Solving maximum flow problems on real world bipartite graphs. In: Proc. of ALENEX, pp. 14\u201328. SIAM (2009)","DOI":"10.1137\/1.9781611972894.2"},{"key":"45_CR24","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":"45_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"781","DOI":"10.1007\/11682462_71","volume-title":"LATIN 2006: Theoretical Informatics","author":"D. Sawitzki","year":"2006","unstructured":"Sawitzki, D.: Exponential Lower Bounds on the Space Complexity of OBDD-Based Graph Algorithms. In: Correa, J.R., Hevia, A., Kiwi, M. (eds.) LATIN 2006. LNCS, vol.\u00a03887, pp. 781\u2013792. Springer, Heidelberg (2006)"},{"key":"45_CR26","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":"45_CR27","unstructured":"Sawitzki, D.: Implicit simulation of FNC algorithms. ECCC Report TR07-028 (2007)"},{"issue":"1-2","key":"45_CR28","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1080\/10637199408915410","volume":"2","author":"T.H. Spencer","year":"1994","unstructured":"Spencer, T.H.: Parallel Approximate Matching. Parallel Algorithms and Applications\u00a02(1-2), 115\u2013121 (1994)","journal-title":"Parallel Algorithms and Applications"},{"key":"45_CR29","doi-asserted-by":"crossref","unstructured":"Wegener, I.: Branching Programs and Binary Decision Diagrams - Theory and Applications. SIAM Monographs on Discrete Mathematics and Applications (2000)","DOI":"10.1137\/1.9780898719789"},{"issue":"1","key":"45_CR30","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. Journal of Discrete Algorithms\u00a04(1), 51\u201371 (2006)","journal-title":"Journal of Discrete Algorithms"}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Models of Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-29952-0_45","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,7]],"date-time":"2023-02-07T08:15:07Z","timestamp":1675757707000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-29952-0_45"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642299513","9783642299520"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-29952-0_45","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}