{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,4,2]],"date-time":"2023-04-02T14:14:21Z","timestamp":1680444861707},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2014,3,7]],"date-time":"2014-03-07T00:00:00Z","timestamp":1394150400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2014,7]]},"DOI":"10.1007\/s10878-014-9722-4","type":"journal-article","created":{"date-parts":[[2014,3,6]],"date-time":"2014-03-06T08:37:15Z","timestamp":1394095035000},"page":"121-139","source":"Crossref","is-referenced-by-count":1,"title":["Characteristics of the maximal independent set ZDD"],"prefix":"10.1007","volume":"28","author":[{"given":"David R.","family":"Morrison","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Edward C.","family":"Sewell","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sheldon H.","family":"Jacobson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,3,7]]},"reference":[{"issue":"6","key":"9722_CR1","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1109\/TC.1978.1675141","volume":"100","author":"SB Akers","year":"1978","unstructured":"Akers SB (1978) Binary decision diagrams. IEEE Trans Comput 100(6):509\u2013516","journal-title":"IEEE Trans Comput"},{"key":"9722_CR2","unstructured":"Behle M (2007) Binary decision diagrams and integer programming. PhD thesis, Universist\u00e4t des Saarlands"},{"key":"9722_CR3","doi-asserted-by":"crossref","unstructured":"Behle M, Eisenbrand F (2007) 0\/1 vertex and facet enumeration with BDDs. In: Workshop on algorithm engineering and experiments (ALENEX)","DOI":"10.1137\/1.9781611972870.15"},{"key":"9722_CR4","series-title":"Integration of AI and OR techniques in contraint programming for combinatorial optimzation problems, no. 7298","first-page":"34","volume-title":"Lecture notes in computer science","author":"D Bergman","year":"2012","unstructured":"Bergman D, Cire AA, Hoeve WV, Hooker JN (2012) Variable ordering for the application of BDDs to the maximum independent set problem. In: Beldiceanu N, Jussien N, Pinson E (eds) Lecture notes in computer science., Integration of AI and OR techniques in contraint programming for combinatorial optimzation problems, no. 7298Springer, Berlin, pp 34\u201349"},{"key":"9722_CR5","doi-asserted-by":"crossref","unstructured":"Bergman D, Cire AA, Hoeve WV, Hooker JN (2013) Optimization bounds from binary decision diagrams. INFORMS J Comput","DOI":"10.1007\/978-3-319-10428-7_64"},{"issue":"9","key":"9722_CR6","doi-asserted-by":"crossref","first-page":"993","DOI":"10.1109\/12.537122","volume":"45","author":"B Bollig","year":"1996","unstructured":"Bollig B, Wegener I (1996) Improving the variable ordering of OBDDs is NP-complete. IEEE Trans Comput 45(9):993\u20131002","journal-title":"IEEE Trans Comput"},{"issue":"9","key":"9722_CR7","doi-asserted-by":"crossref","first-page":"575","DOI":"10.1145\/362342.362367","volume":"16","author":"C Bron","year":"1973","unstructured":"Bron C, Kerbosch J (1973) Algorithm 457: finding all cliques of an undirected graph. Commun ACM 16(9):575\u2013577","journal-title":"Commun ACM"},{"issue":"8","key":"9722_CR8","doi-asserted-by":"crossref","first-page":"677","DOI":"10.1109\/TC.1986.1676819","volume":"C\u201335","author":"R Bryant","year":"1986","unstructured":"Bryant R (1986) Graph-based algorithms for boolean function manipulation. IEEE Trans Comput C\u201335(8):677\u2013691","journal-title":"IEEE Trans Comput"},{"issue":"3","key":"9722_CR9","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1145\/136035.136043","volume":"24","author":"RE Bryant","year":"1992","unstructured":"Bryant RE (1992) Symbolic boolean manipulation with ordered binary-decision diagrams. ACM Comput Surv (CSUR) 24(3):293\u2013318","journal-title":"ACM Comput Surv (CSUR)"},{"key":"9722_CR10","doi-asserted-by":"crossref","unstructured":"Coudert O (1997) Solving graph optimization problems with ZBDDs. In: European design and test conference, pp 224\u2013228","DOI":"10.1109\/EDTC.1997.582363"},{"key":"9722_CR11","series-title":"Experimental algorithms, no. 6630","first-page":"364","volume-title":"Lecture notes in computer science","author":"D Eppstein","year":"2011","unstructured":"Eppstein D, Strash D (2011) Listing all maximal cliques in large sparse real-world graphs. In: Pardalos PM, Rebennack S (eds) Lecture notes in computer science., Experimental algorithms, no. 6630Springer, Berlin, pp 364\u2013375"},{"key":"9722_CR12","unstructured":"Had\u017ei\u0107 T, Hooker J (2008) Postoptimality analysis for integer programming using binary decision diagrams. Tech. Rep. 167, Tepper School of Business"},{"issue":"4","key":"9722_CR13","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1007\/s12532-012-0042-3","volume":"4","author":"S Held","year":"2012","unstructured":"Held S, Cook W, Sewell EC (2012) Maximum-weight stable sets and safe lower bounds for graph coloring. Math Program Comput 4(4):363\u2013381","journal-title":"Math Program Comput"},{"key":"9722_CR14","unstructured":"Johnson DS, Trick MA (1996) Cliques, coloring, and satisfiability: second DIMACS implementation challenge. American Mathematical Society, 11\u201313 Oct 1993"},{"issue":"4","key":"9722_CR15","doi-asserted-by":"crossref","first-page":"985","DOI":"10.1002\/j.1538-7305.1959.tb01585.x","volume":"38","author":"C Lee","year":"1959","unstructured":"Lee C (1959) Representation of switching circuits by binary-decision programs. Bell Syst Tech J 38(4):985\u2013999","journal-title":"Bell Syst Tech J"},{"key":"9722_CR16","doi-asserted-by":"crossref","unstructured":"Minato S (1993) Zero-suppressed BDDs for set manipulation in combinatorial problems. In: 30th Conference on design automation, pp 272\u2013277","DOI":"10.1145\/157485.164890"},{"issue":"2","key":"9722_CR17","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1007\/s100090100038","volume":"3","author":"S Minato","year":"2001","unstructured":"Minato S (2001) Zero-suppressed BDDs and their applications. Int J Softw Tools Technol Transf 3(2):156\u2013170","journal-title":"Int J Softw Tools Technol Transf"},{"key":"9722_CR18","unstructured":"Morrison DR, Sewell EC, Jacobson SH (2014) Solving the pricing problem in a generic branch-and-price algorithm using zero-suppressed binary decision diagrams arXiv:1401.5820 [cs.DS], http:\/\/arxiv.org\/abs\/1401.5820 . Accessed 04 Mar 2014"},{"key":"9722_CR19","unstructured":"Sedgewick R, Wayne K (2011) Algorithms. Addison-Wesley Professional"},{"issue":"1","key":"9722_CR20","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1016\/j.tcs.2006.06.015","volume":"363","author":"E Tomita","year":"2006","unstructured":"Tomita E, Tanaka A, Takahashi H (2006) The worst-case time complexity for generating all maximal cliques and computational experiments. Theor Comput Sci 363(1):28\u201342","journal-title":"Theor Comput Sci"},{"key":"9722_CR21","unstructured":"Trick MA (2005) Computational series: graph coloring and its generalizations. http:\/\/mat.gsia.cmu.edu\/COLOR02\/ . Accessed 04 Mar 2014"},{"key":"9722_CR22","unstructured":"Weisstein EW (2013) Binet\u2019s fibonacci number formula\u2014from wolfram MathWorld. http:\/\/mathworld.wolfram.com\/BinetsFibonacciNumberFormula.html . Accessed 04 Mar 2014"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-014-9722-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-014-9722-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-014-9722-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,16]],"date-time":"2020-08-16T01:55:26Z","timestamp":1597542926000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-014-9722-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,3,7]]},"references-count":22,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2014,7]]}},"alternative-id":["9722"],"URL":"https:\/\/doi.org\/10.1007\/s10878-014-9722-4","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,3,7]]}}}