{"id":"https://openalex.org/W1544252245","doi":"https://doi.org/10.1109/iccnc.2015.7069325","title":"Performance comparison of parallel graph coloring algorithms on BSP model using hadoop","display_name":"Performance comparison of parallel graph coloring algorithms on BSP model using hadoop","publication_year":2015,"publication_date":"2015-02-01","ids":{"openalex":"https://openalex.org/W1544252245","doi":"https://doi.org/10.1109/iccnc.2015.7069325","mag":"1544252245"},"language":"en","primary_location":{"id":"doi:10.1109/iccnc.2015.7069325","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iccnc.2015.7069325","pdf_url":null,"source":{"id":"https://openalex.org/S4306497949","display_name":"2015 International Conference on Computing, Networking and Communications (ICNC)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 International Conference on Computing, Networking and Communications (ICNC)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5005440776","display_name":"Nishant M Gandhi","orcid":null},"institutions":[{"id":"https://openalex.org/I132153292","display_name":"Indian Institute of Technology Patna","ror":"https://ror.org/01ft5vz71","country_code":"IN","type":"education","lineage":["https://openalex.org/I132153292"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"Nishant M Gandhi","raw_affiliation_strings":["Department of Computer Science & Engineering, Indian Institute of Technology, Patna"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science & Engineering, Indian Institute of Technology, Patna","institution_ids":["https://openalex.org/I132153292"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5081123737","display_name":"Rajiv Misra","orcid":"https://orcid.org/0000-0002-4910-5749"},"institutions":[{"id":"https://openalex.org/I132153292","display_name":"Indian Institute of Technology Patna","ror":"https://ror.org/01ft5vz71","country_code":"IN","type":"education","lineage":["https://openalex.org/I132153292"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Rajiv Misra","raw_affiliation_strings":["Department of Computer Science & Engineering, Indian Institute of Technology, Patna"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science & Engineering, Indian Institute of Technology, Patna","institution_ids":["https://openalex.org/I132153292"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5005440776"],"corresponding_institution_ids":["https://openalex.org/I132153292"],"apc_list":null,"apc_paid":null,"fwci":1.8712,"has_fulltext":false,"cited_by_count":17,"citation_normalized_percentile":{"value":0.88457008,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"110","last_page":"116"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9919999837875366,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10101","display_name":"Cloud Computing and Resource Management","score":0.98580002784729,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7829828262329102},{"id":"https://openalex.org/keywords/graph-coloring","display_name":"Graph coloring","score":0.6373645663261414},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5596294403076172},{"id":"https://openalex.org/keywords/maxima-and-minima","display_name":"Maxima and minima","score":0.4871954321861267},{"id":"https://openalex.org/keywords/cluster-analysis","display_name":"Cluster analysis","score":0.44452497363090515},{"id":"https://openalex.org/keywords/graph-algorithms","display_name":"Graph algorithms","score":0.4322145879268646},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.41242778301239014},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.37364301085472107},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2753789722919464},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.13044282793998718},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.12134182453155518}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7829828262329102},{"id":"https://openalex.org/C76946457","wikidata":"https://www.wikidata.org/wiki/Q504843","display_name":"Graph coloring","level":3,"score":0.6373645663261414},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5596294403076172},{"id":"https://openalex.org/C186633575","wikidata":"https://www.wikidata.org/wiki/Q845060","display_name":"Maxima and minima","level":2,"score":0.4871954321861267},{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.44452497363090515},{"id":"https://openalex.org/C2986651925","wikidata":"https://www.wikidata.org/wiki/Q1514868","display_name":"Graph algorithms","level":3,"score":0.4322145879268646},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.41242778301239014},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.37364301085472107},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2753789722919464},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.13044282793998718},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.12134182453155518},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/iccnc.2015.7069325","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iccnc.2015.7069325","pdf_url":null,"source":{"id":"https://openalex.org/S4306497949","display_name":"2015 International Conference on Computing, Networking and Communications (ICNC)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 International Conference on Computing, Networking and Communications (ICNC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W149461665","https://openalex.org/W1778860368","https://openalex.org/W1969970763","https://openalex.org/W1981871151","https://openalex.org/W1994182141","https://openalex.org/W2045271686","https://openalex.org/W2073818615","https://openalex.org/W2087316231","https://openalex.org/W2100061495","https://openalex.org/W2105839944","https://openalex.org/W2108301529","https://openalex.org/W2170616854","https://openalex.org/W2173213060","https://openalex.org/W3105138464","https://openalex.org/W6786025232"],"related_works":["https://openalex.org/W2375684291","https://openalex.org/W2966325078","https://openalex.org/W2908543267","https://openalex.org/W3192711542","https://openalex.org/W2947061677","https://openalex.org/W1948567148","https://openalex.org/W1661934190","https://openalex.org/W1512380301","https://openalex.org/W1486604072","https://openalex.org/W1984711437"],"abstract_inverted_index":{"Nowadays,":[0],"Hadoop":[1],"is":[2,60],"massively":[3],"used":[4],"to":[5,22,61,64],"store":[6],"large":[7,19],"data":[8,14,87],"generated":[9],"by":[10],"various":[11],"sources.":[12],"These":[13],"are":[15,40],"often":[16],"represented":[17],"in":[18,84,151],"scale":[20],"graphs":[21],"solve":[23],"real":[24,85,127],"world":[25,86,128],"problems.":[26],"To":[27],"compute":[28],"those":[29],"data,":[30],"many":[31,81],"Bulk":[32],"Synchronous":[33],"Parallel(BSP)":[34],"model":[35,102],"based":[36,103,149],"graph":[37,58,77,97,129],"processing":[38],"systems":[39],"available":[41],"on":[42,104,126,131],"top":[43],"of":[44,57,153,157],"hadoop":[45,105,133],"such":[46,68,106],"as":[47,107],"Pregel":[48],"and":[49,155],"Stanford:":[50],"Graph":[51],"Processing":[52],"System":[53],"(GPS).":[54],"The":[55,76,135],"problem":[56,79],"coloring":[59,78,98],"assign":[62],"color":[63,158],"all":[65],"the":[66,95],"vertices":[67,72],"that":[69,138],"no":[70],"neighbor":[71],"have":[73,93],"same":[74],"color.":[75],"has":[80],"practical":[82],"application":[83],"analytics.":[88],"In":[89],"this":[90],"paper,":[91],"we":[92],"compared":[94],"heuristic":[96,148],"algorithm":[99,143],"with":[100],"BSP":[101],"Local":[108,111,114,118,139],"Maxima":[109],"First,":[110,113,117],"Minima-Maxima":[112],"Largest":[115],"Degree":[116,120,141],"Smallest-Largest":[119,140],"First.":[121],"We":[122],"experimented":[123],"our":[124,132],"algorithms":[125],"dataset":[130],"cluster.":[134],"result":[136],"shows":[137],"First":[142],"perform":[144],"better":[145],"than":[146],"other":[147],"algorithms,":[150],"term":[152],"runtime":[154],"number":[156],"used.":[159]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":2},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}