{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:36:36Z","timestamp":1759638996942},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642450426"},{"type":"electronic","value":"9783642450433"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-45043-3_25","type":"book-chapter","created":{"date-parts":[[2013,11,12]],"date-time":"2013-11-12T14:05:50Z","timestamp":1384265150000},"page":"286-297","source":"Crossref","is-referenced-by-count":4,"title":["OBDD-Based Representation of Interval Graphs"],"prefix":"10.1007","author":[{"given":"Marc","family":"Gill\u00e9","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"25_CR1","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1145\/357084.357091","volume":"2","author":"D.B. Arnold","year":"1980","unstructured":"Arnold, D.B., Sleep, M.R.: Uniform random generation of balanced parenthesis strings. ACM Trans. Program. Lang. Syst.\u00a02(1), 122\u2013128 (1980)","journal-title":"ACM Trans. Program. Lang. Syst."},{"issue":"1","key":"25_CR2","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/s10703-006-4341-z","volume":"28","author":"R. Bloem","year":"2006","unstructured":"Bloem, R., Gabow, H.N., Somenzi, F.: An algorithm for strongly connected component analysis in n log n symbolic steps. Formal Methods in System Design\u00a028(1), 37\u201356 (2006)","journal-title":"Formal Methods in System Design"},{"key":"25_CR3","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1016\/j.tcs.2011.11.029","volume":"447","author":"B. Bollig","year":"2012","unstructured":"Bollig, B.: On symbolic OBDD-based algorithms for the minimum spanning tree problem. TCS\u00a0447, 2\u201312 (2012)","journal-title":"TCS"},{"key":"25_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1007\/978-3-642-29952-0_45","volume-title":"Theory and Applications of Models of Computation","author":"B. Bollig","year":"2012","unstructured":"Bollig, B., Gill\u00e9, M., Pr\u00f6ger, T.: Implicit computation of maximum bipartite matchings by sublinear functional operations. In: Agrawal, M., Cooper, S.B., Li, A. (eds.) TAMC 2012. LNCS, vol.\u00a07287, pp. 473\u2013486. Springer, Heidelberg (2012)"},{"issue":"5","key":"25_CR5","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. IPL\u00a059(5), 233\u2013239 (1996)","journal-title":"IPL"},{"key":"25_CR6","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)"},{"issue":"3","key":"25_CR7","doi-asserted-by":"publisher","first-page":"558","DOI":"10.1006\/jcss.2000.1733","volume":"61","author":"B. Bollig","year":"2000","unstructured":"Bollig, B., Wegener, I.: Asymptotically optimal bounds for OBDDs and the solution of some basic OBDD problems. Journal of Computer and System Sciences\u00a061(3), 558\u2013579 (2000)","journal-title":"Journal of Computer and System Sciences"},{"issue":"8","key":"25_CR8","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 Transactions on Computers\u00a035(8), 677\u2013691 (1986)","journal-title":"IEEE Transactions on Computers"},{"issue":"2","key":"25_CR9","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1016\/0890-5401(92)90017-A","volume":"98","author":"J.R. Burch","year":"1992","unstructured":"Burch, J.R., Clarke, E.M., McMillan, K.L., Dill, D.L., Hwang, L.J.: Symbolic model checking: 1020 states and beyond. Information and Computation\u00a098(2), 142\u2013170 (1992)","journal-title":"Information and Computation"},{"key":"25_CR10","unstructured":"Chung, Y., Park, K., Cho, Y.: Parallel maximum matching algorithms in interval graphs. In: Proc. of the 4th ICPADS, pp. 602\u2013609 (1997)"},{"key":"25_CR11","unstructured":"Coudert, O.: Doing two-level logic minimization 100 times faster. In: Proc. of the 6th SODA, pp. 112\u2013121 (1995)"},{"key":"25_CR12","unstructured":"Gentilini, R., Piazza, C., Policriti, A.: Computing strongly connected components in a linear number of symbolic steps. In: Proc. of the 14th SODA, pp. 573\u2013582 (2003)"},{"issue":"1","key":"25_CR13","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"},{"key":"25_CR14","unstructured":"Gill\u00e9, M.: OBDD-Based Representation of Interval Graphs. ArXiv e-prints (2013), http:\/\/arxiv.org\/abs\/1305.2772"},{"key":"25_CR15","doi-asserted-by":"crossref","unstructured":"Golumbic, M.C.: Algorithmic Graph Theory and Perfect Graphs. Annals of Discrete Mathematics, vol.\u00a057. North-Holland Publishing Co. (2004)","DOI":"10.1016\/S0167-5060(04)80051-7"},{"issue":"2\/3","key":"25_CR16","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 algorithms for maximum flow in 0-1 networks. Formal Methods in System Design\u00a010(2\/3), 207\u2013219 (1997)","journal-title":"Formal Methods in System Design"},{"issue":"1-2","key":"25_CR17","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/S0304-3975(97)83807-8","volume":"180","author":"K. Hosaka","year":"1997","unstructured":"Hosaka, K., Takenaga, Y., Kaneda, T., Yajima, S.: Size of ordered binary decision diagrams representing threshold functions. Theor. Comput. Sci.\u00a0180(1-2), 47\u201360 (1997)","journal-title":"Theor. Comput. Sci."},{"issue":"8","key":"25_CR18","doi-asserted-by":"publisher","first-page":"959","DOI":"10.1109\/43.298033","volume":"13","author":"Y.-T. Lai","year":"1994","unstructured":"Lai, Y.-T., Pedram, M., Vrudhula, S.B.K.: EVBDD-based algorithms for integer linear programming, spectral transformation, and function decomposition. IEEE Transactions on CAD of Integrated Circuits and Systems\u00a013(8), 959\u2013975 (1994)","journal-title":"IEEE Transactions on CAD of Integrated Circuits and Systems"},{"issue":"4","key":"25_CR19","doi-asserted-by":"publisher","first-page":"843","DOI":"10.1016\/j.disc.2008.01.022","volume":"309","author":"K. Meer","year":"2009","unstructured":"Meer, K., Rautenbach, D.: On the OBDD size for graphs of bounded tree- and clique-width. Discrete Mathematics\u00a0309(4), 843\u2013851 (2009)","journal-title":"Discrete Mathematics"},{"issue":"1","key":"25_CR20","first-page":"21","volume":"33","author":"C. Meinel","year":"1999","unstructured":"Meinel, C., Theobald, T.: On the influence of the state encoding on OBDD-representations of finite state machines. ITA\u00a033(1), 21\u201332 (1999)","journal-title":"ITA"},{"issue":"4","key":"25_CR21","doi-asserted-by":"publisher","first-page":"332","DOI":"10.1016\/j.aml.2007.04.001","volume":"21","author":"G.B. Mertzios","year":"2008","unstructured":"Mertzios, G.B.: A matrix characterization of interval and proper interval graphs. Applied Mathematics Letters\u00a021(4), 332\u2013337 (2008)","journal-title":"Applied Mathematics Letters"},{"issue":"2","key":"25_CR22","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1016\/j.dam.2008.02.012","volume":"157","author":"R. Nunkesser","year":"2009","unstructured":"Nunkesser, R., Woelfel, P.: Representation of graphs by OBDDs. Discrete Applied Mathematics\u00a0157(2), 247\u2013261 (2009)","journal-title":"Discrete Applied Mathematics"},{"key":"25_CR23","unstructured":"Roberts, F.S.: Indifference graphs. In: Harary, F. (ed.) Proof Techniques in Graph Theory, pp. 139\u2013146 (1969)"},{"issue":"7","key":"25_CR24","doi-asserted-by":"crossref","first-page":"1816","DOI":"10.1587\/transinf.E93.D.1816","volume":"93-D","author":"T. Saitoh","year":"2010","unstructured":"Saitoh, T., Yamanaka, K., Kiyomi, M., Uehara, R.: Random generation and enumeration of proper interval graphs. IEICE Transactions\u00a093-D(7), 1816\u20131823 (2010)","journal-title":"IEICE Transactions"},{"key":"25_CR25","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":"25_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":"25_CR27","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":"25_CR28","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1142\/S0129626493000022","volume":"3","author":"D. Sieling","year":"1993","unstructured":"Sieling, D., Wegener, I.: NC-algorithms for operations on binary decision diagrams. Parallel Processing Letters\u00a03, 3\u201312 (1993)","journal-title":"Parallel Processing Letters"},{"key":"25_CR29","doi-asserted-by":"crossref","unstructured":"Wegener, I.: Branching programs and binary decision diagrams. SIAM Monographs on Discrete Mathematics and Applications (2000)","DOI":"10.1137\/1.9780898719789"},{"key":"25_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, 51\u201371 (2006)","journal-title":"Journal of Discrete Algorithms"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-45043-3_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,1]],"date-time":"2019-08-01T16:00:36Z","timestamp":1564675236000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-45043-3_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642450426","9783642450433"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-45043-3_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}