{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,8]],"date-time":"2025-09-08T06:25:01Z","timestamp":1757312701841,"version":"3.40.3"},"publisher-location":"Cham","reference-count":29,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030594152"},{"type":"electronic","value":"9783030594169"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"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":[[2020]]},"DOI":"10.1007\/978-3-030-59416-9_21","type":"book-chapter","created":{"date-parts":[[2020,9,21]],"date-time":"2020-09-21T16:08:14Z","timestamp":1600704494000},"page":"349-367","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Efficient Parallel Cycle Search in Large Graphs"],"prefix":"10.1007","author":[{"given":"Zhu","family":"Qing","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Long","family":"Yuan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zi","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jingjing","family":"Lin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guojie","family":"Ma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,9,22]]},"reference":[{"key":"21_CR1","doi-asserted-by":"crossref","unstructured":"Bernstein, A., Chechi, S.: Incremental topological sort and cycle detection in expected total time, pp. 21\u201334, January 2018","DOI":"10.1137\/1.9781611975031.2"},{"issue":"5","key":"21_CR2","doi-asserted-by":"publisher","first-page":"720","DOI":"10.1145\/324133.324234","volume":"46","author":"RD Blumofe","year":"1999","unstructured":"Blumofe, R.D., Leiserson, C.E.: Scheduling multithreaded computations by work stealing. J. ACM 46(5), 720\u2013748 (1999)","journal-title":"J. ACM"},{"key":"21_CR3","series-title":"Lecture Notes in Social Networks","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/978-3-319-95810-1_2","volume-title":"Applications of Data Management and Analysis","author":"A Bodaghi","year":"2018","unstructured":"Bodaghi, A., Teimourpour, B.: Automobile insurance fraud detection using social network analysis. In: Moshirpour, M., Far, B.H., Alhajj, R. (eds.) Applications of Data Management and Analysis. LNSN, pp. 11\u201316. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-95810-1_2"},{"key":"21_CR4","doi-asserted-by":"crossref","unstructured":"Bondy, J.A., Murty, U.S.R.: Graph theory with applications (1976)","DOI":"10.1007\/978-1-349-03521-2"},{"key":"21_CR5","doi-asserted-by":"crossref","unstructured":"Cao, Y., Li, Y., Coleman, S., Belatreche, A., McGinnity, T.M.: Detecting wash trade in the financial market. In: 2014 IEEE Conference on Computational Intelligence for Financial Engineering and Economics (CIFEr), pp. 85\u201391. IEEE (2014)","DOI":"10.1109\/CIFEr.2014.6924058"},{"issue":"1","key":"21_CR6","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1109\/99.660313","volume":"5","author":"L Dagum","year":"1998","unstructured":"Dagum, L., Menon, R.: OpenMP: an industry-standard API for shared-memory programming. IEEE Comput. Sci. Eng. 5(1), 46\u201355 (1998)","journal-title":"IEEE Comput. Sci. Eng."},{"issue":"3","key":"21_CR7","doi-asserted-by":"publisher","first-page":"18:1","DOI":"10.1145\/2489791","volume":"38","author":"W Fan","year":"2013","unstructured":"Fan, W., Wang, X., Wu, Y.: Incremental graph pattern matching. ACM Trans. Database Syst. 38(3), 18:1\u201318:47 (2013)","journal-title":"ACM Trans. Database Syst."},{"issue":"3","key":"21_CR8","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1007\/s10619-018-7232-6","volume":"36","author":"X Feng","year":"2018","unstructured":"Feng, X., Chang, L., Lin, X., Qin, L., Zhang, W., Yuan, L.: Distributed computing connected components with linear communication cost. Distrib Parallel Databases 36(3), 555\u2013592 (2018). https:\/\/doi.org\/10.1007\/s10619-018-7232-6","journal-title":"Distrib Parallel Databases"},{"issue":"3","key":"21_CR9","doi-asserted-by":"publisher","first-page":"12:1","DOI":"10.1145\/3322811","volume":"6","author":"P Fraigniaud","year":"2019","unstructured":"Fraigniaud, P., Olivetti, D.: Distributed detection of cycles. ACM Trans. Parallel Comput. 6(3), 12:1\u201312:20 (2019)","journal-title":"ACM Trans. Parallel Comput."},{"issue":"1","key":"21_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1080\/21649502.2013.802877","volume":"1","author":"Z-Q Jiang","year":"2013","unstructured":"Jiang, Z.-Q., et al.: Trading networks, abnormal motifs and stock manipulation. Quant. Financ. Lett. 1(1), 1\u20138 (2013)","journal-title":"Quant. Financ. Lett."},{"key":"21_CR11","doi-asserted-by":"crossref","unstructured":"Kankanamge, C., Sahu, S., Mhedbhi, A., Chen, J., Salihoglu, S.: Graphflow: An active graph database. In Proceedings of the 2017 ACM International Conference on Management of Data, SIGMOD 2017, pp. 1695\u20131698, New York. ACM (2017)","DOI":"10.1145\/3035918.3056445"},{"key":"21_CR12","doi-asserted-by":"crossref","unstructured":"Kosaraju, S., Sullivan, G.: Detecting cycles in dynamic graphs in polynomial time. In: Proceedings 20th Annual ACM Symposium on Theory Computing, pp. 398\u2013406, January 1988","DOI":"10.1145\/62212.62251"},{"issue":"10","key":"21_CR13","doi-asserted-by":"publisher","first-page":"1099","DOI":"10.14778\/3339490.3339494","volume":"12","author":"L Lai","year":"2019","unstructured":"Lai, L., et al.: Distributed subgraph matching on timely dataflow. Proc. VLDB Endow. 12(10), 1099\u20131112 (2019)","journal-title":"Proc. VLDB Endow."},{"key":"21_CR14","series-title":"Advances in Intelligent Systems and Computing","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1007\/978-3-030-03405-4_14","volume-title":"Advances in Information and Communication Networks","author":"PS Lee","year":"2019","unstructured":"Lee, P.S., Owda, M., Crockett, K.: the detection of fraud activities on the stock market through forward analysis methodology of financial discussion boards. In: Arai, K., Kapoor, S., Bhatia, R. (eds.) FICC 2018. AISC, vol. 887, pp. 212\u2013220. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-03405-4_14"},{"key":"21_CR15","doi-asserted-by":"crossref","unstructured":"Liu, B., Yuan, L., Lin, X., Qin, L., Zhang, W., Zhou, J.: Efficient ($$\\alpha $$, $$\\beta $$)-core computation: an index-based approach. In: Proceedings of WWW, pp. 1130\u20131141 (2019)","DOI":"10.1145\/3308558.3313522"},{"issue":"5","key":"21_CR16","first-page":"602","volume":"13","author":"D Ouyang","year":"2020","unstructured":"Ouyang, D., Long Yuan, L., Qin, L.C., Zhang, Y.: Efficient shortest path index maintenance on dynamic road networks with theoretical guarantees. PVLDB 13(5), 602\u2013615 (2020)","journal-title":"PVLDB"},{"key":"21_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/978-3-319-91452-7_16","volume-title":"Database Systems for Advanced Applications","author":"D Ouyang","year":"2018","unstructured":"Ouyang, D., Yuan, L., Zhang, F., Qin, L., Lin, X.: Towards efficient path skyline computation in bicriteria networks. In: Pei, J., Manolopoulos, Y., Sadiq, S., Li, J. (eds.) DASFAA 2018. LNCS, vol. 10827, pp. 239\u2013254. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-91452-7_16"},{"key":"21_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/978-3-319-91452-7_14","volume-title":"Database Systems for Advanced Applications","author":"Z Qing","year":"2018","unstructured":"Qing, Z., Yuan, L., Zhang, F., Qin, L., Lin, X., Zhang, W.: External topological sorting in large graphs. In: Pei, J., Manolopoulos, Y., Sadiq, S., Li, J. (eds.) DASFAA 2018. LNCS, vol. 10827, pp. 203\u2013220. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-91452-7_14"},{"issue":"12","key":"21_CR19","first-page":"1876","volume":"11","author":"X Qiu","year":"2018","unstructured":"Qiu, X., Cen, W., Qian, Z., Peng, Y., Zhang, Y., Lin, X., Zhou, J.: Real-time constrained cycle detection in large dynamic graphs. PVLDB 11(12), 1876\u20131888 (2018)","journal-title":"PVLDB"},{"key":"21_CR20","unstructured":"Rocha, R., Thatte, B: Distributed cycle detection in large-scale sparse graphs, August 2015"},{"issue":"4","key":"21_CR21","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/0020-0190(83)90038-8","volume":"17","author":"O Shmueli","year":"1983","unstructured":"Shmueli, O.: Dynamic cycle detection. Inf. Process. Lett. 17(4), 185\u2013188 (1983)","journal-title":"Inf. Process. Lett."},{"key":"21_CR22","doi-asserted-by":"crossref","unstructured":"Shun, J., Blelloch, G.E.: Ligra: a lightweight graph processing framework for shared memory. In: ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPoPP 2013, Shenzhen, China, 23\u201327 February 2013, pp. 135\u2013146 (2013)","DOI":"10.1145\/2517327.2442530"},{"issue":"1","key":"21_CR23","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1145\/1866739.1866757","volume":"54","author":"U Vishkin","year":"2011","unstructured":"Vishkin, U.: Using simple abstraction to reinvent computing for parallelism. Commun. ACM 54(1), 75\u201385 (2011)","journal-title":"Commun. ACM"},{"key":"21_CR24","doi-asserted-by":"crossref","unstructured":"Wu, X., Yuan, L., Lin, X., Yang, S., Zhang, W.: Towards efficient k-TriPeak decomposition on large graphs. In: Proceedings of International Conference on Database Systems for Advanced Applications, pp. 604\u2013621 (2019)","DOI":"10.1007\/978-3-030-18576-3_36"},{"issue":"2","key":"21_CR25","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/s00778-015-0408-z","volume":"25","author":"L Long Yuan","year":"2016","unstructured":"Long Yuan, L., Qin, X.L., Chang, L., Zhang, W.: Diversified top-k clique search. VLDB J. 25(2), 171\u2013196 (2016)","journal-title":"VLDB J."},{"issue":"2","key":"21_CR26","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/s00778-016-0451-4","volume":"26","author":"L Yuan","year":"2016","unstructured":"Yuan, L., Qin, L., Lin, X., Chang, L., Zhang, W.: I\/O efficient ECC graph decomposition via graph reduction. VLDB J. 26(2), 275\u2013300 (2016). https:\/\/doi.org\/10.1007\/s00778-016-0451-4","journal-title":"VLDB J."},{"issue":"3","key":"21_CR27","first-page":"338","volume":"11","author":"L Long Yuan","year":"2017","unstructured":"Long Yuan, L., Qin, X.L., Chang, L., Zhang, W.: Effective and efficient dynamic graph coloring. PVLDB 11(3), 338\u2013351 (2017)","journal-title":"PVLDB"},{"issue":"2","key":"21_CR28","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/s00778-016-0451-4","volume":"26","author":"L Yuan","year":"2016","unstructured":"Yuan, L., Qin, L., Lin, X., Chang, L., Zhang, W.: I\/O efficient ECC graph decomposition via graph reduction. VLDB J. 26(2), 275\u2013300 (2016). https:\/\/doi.org\/10.1007\/s00778-016-0451-4","journal-title":"VLDB J."},{"issue":"5","key":"21_CR29","first-page":"922","volume":"30","author":"L Yuan","year":"2018","unstructured":"Yuan, L., Qin, W.Z., Chang, L., Yang, J.: Index-based densest clique percolation community search in networks. IEEE TKDE 30(5), 922\u2013935 (2018)","journal-title":"IEEE TKDE"}],"container-title":["Lecture Notes in Computer Science","Database Systems for Advanced Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-59416-9_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T11:34:49Z","timestamp":1709811289000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-59416-9_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030594152","9783030594169"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-59416-9_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"22 September 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DASFAA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Database Systems for Advanced Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Jeju","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Korea (Republic of)","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 September 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 September 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dasfaa2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/db.pknu.ac.kr\/dasfaa2020\/","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":"487","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":"119","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":"23","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":"24% - 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.11","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":"6.81","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)"}},{"value":"15 demo papers and 4 industrial papers","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}