{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,5]],"date-time":"2026-05-05T12:28:53Z","timestamp":1777984133481,"version":"3.51.4"},"reference-count":42,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2023]]},"DOI":"10.1109\/access.2023.3281266","type":"journal-article","created":{"date-parts":[[2023,5,29]],"date-time":"2023-05-29T13:39:49Z","timestamp":1685367589000},"page":"54986-55001","source":"Crossref","is-referenced-by-count":7,"title":["MapReduce for Graphs Processing: New Big Data Algorithm for 2-Edge Connected Components and Future Ideas"],"prefix":"10.1109","volume":"11","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3200-4933","authenticated-orcid":false,"given":"Devendra","family":"Dahiphale","sequence":"first","affiliation":[{"name":"Department of Computer Science and Electrical Engineering, University of Maryland, Baltimore County, Baltimore, MD, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref13","article-title":"Finding 2-edge and 2-vertex strongly connected components in quadratic time","author":"henzinger","year":"2014","journal-title":"arXiv 1412 6466"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/ICESA.2015.7503401"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1561\/0400000014"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2022.3219422"},{"key":"ref15","year":"2022","journal-title":"Hadoop"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-39718-2_23"},{"key":"ref14","first-page":"137","article-title":"MapReduce: Simplified data processing on large clusters","author":"dean","year":"2004","journal-title":"Proc OSDI"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2013.110"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1987.19"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1007\/BF01099359"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1989.63475"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2014.2322594"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/SWAT.1971.10"},{"key":"ref32","first-page":"513","article-title":"Computing k-edge-connected components of a multigraph (special section on discrete mathematics and its applications)","volume":"76","author":"nagamochi","year":"1993","journal-title":"IEICE Trans Fundamentals Electron Commun Comput Sci"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/CSITechnol.2017.8312127"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-349-03521-2"},{"key":"ref17","author":"dahiphale","year":"2017","journal-title":"An Algorithm for Finding 2-Edge Connected Components in Undirected Graphs Using MapReduc"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2021.3093329"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ITAIC54216.2022.9836776"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1145\/1772690.1772751"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/PROC.1977.10517"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/EIConRus49466.2020.9039470"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/EMS.2011.76"},{"key":"ref23","first-page":"313","article-title":"MapReduce online","author":"condie","year":"2010","journal-title":"Proc NSDI"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/IC-NC.2010.58"},{"key":"ref25","author":"mishra","year":"2019","journal-title":"Apache Spark Based Analytics of Squid Proxy Logs"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1142\/9789814434478_0005"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/ICDMW.2015.96"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1145\/3035918.3064014"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/0016-0032(65)90340-6"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2006.1603363"},{"key":"ref28","article-title":"Dominator tree certification and independent spanning trees","author":"georgiadis","year":"2013","journal-title":"arXiv 1210 8303"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/BF01758778"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2015.10.001"},{"key":"ref8","first-page":"573","article-title":"Computing strongly connected components in a linear number of symbolic steps","volume":"3","author":"gentilini","year":"2003","journal-title":"Proc SODA"},{"key":"ref7","first-page":"1811","article-title":"Dijkstra’s shortest path algorithm serial and parallel execution performance analysis","author":"jasika","year":"2012","journal-title":"Proc 35th Int Conv MIPRO"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45591-4_68"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/2670979.2670997"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ICAPP.1995.472215"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TNSM.2014.031714.130407"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-55808-X_10"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2020.3009577"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/10005208\/10138399.pdf?arnumber=10138399","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,9]],"date-time":"2023-06-09T11:18:39Z","timestamp":1686309519000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10138399\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"references-count":42,"URL":"https:\/\/doi.org\/10.1109\/access.2023.3281266","relation":{"is-supplemented-by":[{"id-type":"doi","id":"10.36227\/techrxiv.21802102","asserted-by":"object"}],"has-preprint":[{"id-type":"doi","id":"10.36227\/techrxiv.21802102","asserted-by":"object"},{"id-type":"doi","id":"10.36227\/techrxiv.21802102.v2","asserted-by":"object"},{"id-type":"doi","id":"10.36227\/techrxiv.21802102.v1","asserted-by":"object"},{"id-type":"doi","id":"10.36227\/techrxiv.21802102.v3","asserted-by":"object"}]},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]}}}