{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T07:26:48Z","timestamp":1743146808942,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030869816"},{"type":"electronic","value":"9783030869823"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-86982-3_12","type":"book-chapter","created":{"date-parts":[[2021,9,17]],"date-time":"2021-09-17T18:50:32Z","timestamp":1631904632000},"page":"155-169","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Random Generation of a Locally Consistent Spatio-Temporal Graph"],"prefix":"10.1007","author":[{"given":"Aur\u00e9lie","family":"Leborgne","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marija","family":"Kirandjiska","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Florence Le","family":"Ber","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,9,15]]},"reference":[{"key":"12_CR1","doi-asserted-by":"crossref","unstructured":"Aiello, W., Chung, F., Lu, L.: A random graph model for massive graphs. In: Proceedings of the 32th ACM Symposium on Theory of Computing, STOC 2000, pp. 171\u2013180 (2000)","DOI":"10.1145\/335305.335326"},{"key":"12_CR2","unstructured":"Bessi\u00e8re, C.: A simple way to improve path consistency processing in interval algebra networks. In: Proceedings of the 13th National Conference on Artificial Intelligence (AAAI-1996), pp. 375\u2013380 (1996)"},{"issue":"2","key":"12_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3379445","volume":"53","author":"A Bonifati","year":"2020","unstructured":"Bonifati, A., Holubov\u00e1, I., Prat-P\u00e9rez, A., Sakr, S.: Graph generators: state of the art and open challenges. ACM Comput. Surv. 53(2), 1\u201330 (2020)","journal-title":"ACM Comput. Surv."},{"issue":"6209","key":"12_CR4","doi-asserted-by":"publisher","first-page":"561","DOI":"10.1126\/science.1256492","volume":"346","author":"C Campbell","year":"2014","unstructured":"Campbell, C., Shea, K., Albert, R.: Comment on control profiles of complex networks. Science 346(6209), 561 (2014)","journal-title":"Science"},{"key":"12_CR5","series-title":"Lecture Notes in Physics","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1007\/978-3-540-44943-0_7","volume-title":"Statistical Mechanics of Complex Networks","author":"R Ferrer i Cancho","year":"2003","unstructured":"Ferrer i Cancho, R., Sol\u00e9, R.: Optimization in complex networks. In: Pastor-Satorras, R., Rubi, M., Diaz-Guilera, A. (eds.) Statistical Mechanics of Complex Networks. Lecture Notes in Physics, vol. 625, pp. 114\u2013126. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-44943-0_7"},{"key":"12_CR6","doi-asserted-by":"crossref","unstructured":"Chakrabarti, D., Zhan, Y., Faloutsos, C.: R-MAT: a recursive model for graph mining. In: Proceedings of the 2004 SIAM International Conference on Data Mining, pp. 442\u2013446 (2004)","DOI":"10.1137\/1.9781611972740.43"},{"key":"12_CR7","unstructured":"Condotta, J.F., Ligozat, G., Saade, M.: Empirical study of algorithms for qualitative temporal or spatial constraint networks. In: Proceedings of the 17th European Conference on Artificial Intelligence, Riva del Garda, Italy (2006)"},{"key":"12_CR8","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/j.datak.2012.12.007","volume":"84","author":"G Del Mondo","year":"2013","unstructured":"Del Mondo, G., Rodr\u00edguez, M.A., Claramunt, C., Bravo, L., Thibaud, R.: Modeling consistency of spatio-temporal graphs. Data Knowl. Eng. 84, 59\u201380 (2013)","journal-title":"Data Knowl. Eng."},{"key":"12_CR9","first-page":"1452","volume":"16","author":"G Del Mondo","year":"2010","unstructured":"Del Mondo, G., Stell, J.G., Claramunt, C., Thibaud, R.: A graph model for spatio-temporal evolution. J. Univ. Comput. Sci. 16, 1452\u20131477 (2010)","journal-title":"J. Univ. Comput. Sci."},{"key":"12_CR10","unstructured":"Kuramochi, M., Karypis, G.: Frequent subgraph discovery. In: Proceedings 2001 IEEE International Conference on Data Mining, pp. 313\u2013320 (2001)"},{"key":"12_CR11","unstructured":"Leborgne, A., Nuss, J., Le Ber, F., Marc-Zwecker, S.: An approach for generating random temporal semantic graphs with embedded patterns. In: Graph Embedding and Mining, ECML-PKDD 2020 Workshop Proceedings (2020)"},{"key":"12_CR12","doi-asserted-by":"crossref","unstructured":"Leborgne, A., Le Ber, F., Degiorgis, L., Harsan, L., Marc-Zwecker, S., Noblet, V.: Analysis of brain functional connectivity by frequent pattern mining in graphs. application to the characterization of murine models. In: Proceedings of the International Symposium on Biomedical Imaging, ISBI 2021, pp. 1\u20134 (2021)","DOI":"10.1109\/ISBI48211.2021.9434117"},{"key":"12_CR13","doi-asserted-by":"crossref","unstructured":"Park, H., Kim, M.S.: TrillionG: a trillion-scale synthetic graph generator using a recursive vector model. In: Proceedings of the 2017 ACM International Conference on Management of Data, pp. 913\u2013928 (2017)","DOI":"10.1145\/3035918.3064014"},{"key":"12_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"786","DOI":"10.1007\/3-540-55602-8_225","volume-title":"Automated Deduction\u2014CADE-11","author":"DA Randell","year":"1992","unstructured":"Randell, D.A., Cohn, A.G., Cui, Z.: Computing transitivity tables: a challenge for automated theorem provers. In: Kapur, D. (ed.) CADE 1992. LNCS, vol. 607, pp. 786\u2013790. Springer, Heidelberg (1992). https:\/\/doi.org\/10.1007\/3-540-55602-8_225"},{"key":"12_CR15","unstructured":"Randell, D.A., Cui, Z., Cohn, A.G.: A spatial logic based on regions and connection. In: Proceedings 3rd International Conference on Knowledge Representation and Reasoning, pp. 165\u2013176. Morgan Kaufmann Publishers (1992)"},{"key":"12_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"534","DOI":"10.1007\/11564751_40","volume-title":"Principles and Practice of Constraint Programming - CP 2005","author":"J Renz","year":"2005","unstructured":"Renz, J., Ligozat, G.: Weak composition for qualitative spatial and temporal reasoning. In: van Beek, P. (ed.) CP 2005. LNCS, vol. 3709, pp. 534\u2013548. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11564751_40"},{"issue":"6","key":"12_CR17","doi-asserted-by":"publisher","first-page":"893","DOI":"10.1093\/comnet\/cnx016","volume":"5","author":"G Rossetti","year":"2017","unstructured":"Rossetti, G.: RDYN: graph benchmark handling community dynamics. J. Complex Netw. 5(6), 893\u2013912 (2017)","journal-title":"J. Complex Netw."},{"key":"12_CR18","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1007\/978-3-319-10554-3_10","volume-title":"Artificial Intelligence: Methodology, Systems, and Applications","author":"M Sioutis","year":"2014","unstructured":"Sioutis, M., Condotta, J.-F.: Incrementally building partially path consistent qualitative constraint networks. In: Agre, G., Hitzler, P., Krisnadhi, A.A., Kuznetsov, S.O. (eds.) AIMSA 2014. LNCS (LNAI), vol. 8722, pp. 104\u2013116. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-10554-3_10"},{"key":"12_CR19","unstructured":"Sridhar, M., Cohn, A.G., Hogg, D.C.: Relational graph mining for learning events from video. In: Stairs 2010: Proceedings of the Fifth Starting AI Researchers\u2019 Symposium, pp. 315\u2013327 (2011)"},{"key":"12_CR20","first-page":"373","volume-title":"Readings on Qualitative Reasoning about Physical Systems","author":"M Vilain","year":"1989","unstructured":"Vilain, M., Kautz, H., Beek, P.V.: Constraint propagation algorithms for temporal reasoning: a revised report. In: Weld, D.S., De Kleer, J. (eds.) Readings on Qualitative Reasoning about Physical Systems, pp. 373\u2013381. Morgan Kaufmann, Burlington (1989)"}],"container-title":["Lecture Notes in Computer Science","Graph-Based Representation and Reasoning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-86982-3_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,9,17]],"date-time":"2021-09-17T18:52:31Z","timestamp":1631904751000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-86982-3_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030869816","9783030869823"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-86982-3_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"15 September 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICCS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Conceptual Structures","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 September 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 September 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iccs-conceptstruct2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/iccs-conference.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"25","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"11","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"5","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"44% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.56","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.54","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}