{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:19:52Z","timestamp":1740097192312,"version":"3.37.3"},"publisher-location":"Cham","reference-count":8,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319164854"},{"type":"electronic","value":"9783319164861"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"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":[[2015]]},"DOI":"10.1007\/978-3-319-16486-1_3","type":"book-chapter","created":{"date-parts":[[2015,3,25]],"date-time":"2015-03-25T07:45:52Z","timestamp":1427269552000},"page":"23-31","source":"Crossref","is-referenced-by-count":0,"title":["Concurrency Detection on Finish-to-Start Activity Precedence Networks"],"prefix":"10.1007","author":[{"given":"Rui","family":"Moutinho","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anabela","family":"Tereso","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"9","key":"3_CR1","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1145\/362342.362367","volume":"16","author":"C. Bron","year":"1973","unstructured":"Bron, C., Kerbosch, J.: Algorithm 457: Finding all cliques of an undirected graph. Commun. ACM\u00a016(9), 575\u2013577 (1973), \n                    \n                      http:\/\/doi.acm.org\/10.1145\/362342.362367","journal-title":"Commun. ACM"},{"issue":"1-3","key":"3_CR2","doi-asserted-by":"publisher","first-page":"564","DOI":"10.1016\/j.tcs.2008.05.010","volume":"407","author":"F. Cazals","year":"2008","unstructured":"Cazals, F., Karande, C.: A note on the problem of reporting maximal cliques. Theoretical Computer Science\u00a0407(1-3), 564\u2013568 (2008), \n                    \n                      http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0304397508003903","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"3_CR3","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/s00453-012-9632-8","volume":"66","author":"L. Chang","year":"2013","unstructured":"Chang, L., Yu, J., Qin, L.: Fast maximal cliques enumeration in sparse graphs. Algorithmica\u00a066(1), 173\u2013186 (2013), \n                    \n                      http:\/\/dx.doi.org\/10.1007\/s00453-012-9632-8","journal-title":"Algorithmica"},{"key":"3_CR4","unstructured":"Demeulemeester, E.L., Herroelen, W.S.: Project Scheduling - A Research Handbook. International Series in Operations Research & Management Science, vol.\u00a049. Kluwer Academic Publishers (2002)"},{"key":"3_CR5","doi-asserted-by":"publisher","first-page":"1106","DOI":"10.1016\/j.protcy.2014.10.125","volume":"16","author":"R. Moutinho","year":"2014","unstructured":"Moutinho, R., Tereso, A.: Scheduling of Multimodal Activities with Multiple Renewable and Availability Constrained Resources under Stochastic Conditions. Procedia Technology\u00a016, 1106\u20131115 (2014)","journal-title":"Procedia Technology"},{"key":"3_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1007\/978-3-319-03536-9_13","volume-title":"Algorithms and Models for the Web Graph","author":"B. Pattabiraman","year":"2013","unstructured":"Pattabiraman, B., Patwary, M. M.A., Gebremedhin, A.H., Liao, W.-k., Choudhary, A.: Fast algorithms for the maximum clique problem on massive sparse graphs. In: Bonato, A., Mitzenmacher, M., Pra\u0142at, P. (eds.) WAW 2013. LNCS, vol.\u00a08305, pp. 156\u2013169. Springer, Heidelberg (2013)"},{"issue":"4","key":"3_CR7","doi-asserted-by":"publisher","first-page":"545","DOI":"10.3390\/a5040545","volume":"5","author":"P. Prosser","year":"2012","unstructured":"Prosser, P.: Exact algorithms for maximum clique: A computational study. Algorithms\u00a05(4), 545\u2013587 (2012)","journal-title":"Algorithms"},{"key":"3_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/978-3-540-27798-9_19","volume-title":"Computing and Combinatorics","author":"E. Tomita","year":"2004","unstructured":"Tomita, E., Tanaka, A., Takahashi, H.: The worst-case time complexity for generating all maximal cliques (Computing and Combinatorics 10th Annual International Conference on Computing and Combinatorics (COCOON 2004)). In: Chwa, K.-Y., Munro, J.I. (eds.) COCOON 2004. LNCS, vol.\u00a03106, pp. 161\u2013170. Springer, Heidelberg (2004), \n                    \n                      http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0304397506003586\n                    \n                    \n                  , doi:10.1016\/j.tcs.2006.06.015"}],"container-title":["Advances in Intelligent Systems and Computing","New Contributions in Information Systems and Technologies"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-16486-1_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T13:43:02Z","timestamp":1559137382000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-16486-1_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319164854","9783319164861"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-16486-1_3","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"type":"print","value":"2194-5357"},{"type":"electronic","value":"2194-5365"}],"subject":[],"published":{"date-parts":[[2015]]}}}