{"id":"https://openalex.org/W1988095216","doi":"https://doi.org/10.1109/adcons.2013.9","title":"An Empirical Study of Two MIS Algorithms","display_name":"An Empirical Study of Two MIS Algorithms","publication_year":2013,"publication_date":"2013-12-01","ids":{"openalex":"https://openalex.org/W1988095216","doi":"https://doi.org/10.1109/adcons.2013.9","mag":"1988095216"},"language":"en","primary_location":{"id":"doi:10.1109/adcons.2013.9","is_oa":false,"landing_page_url":"https://doi.org/10.1109/adcons.2013.9","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 2nd International Conference on Advanced Computing, Networking and Security","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/A5078248126","display_name":"Tushar Bisht","orcid":null},"institutions":[{"id":"https://openalex.org/I64189192","display_name":"International Institute of Information Technology, Hyderabad","ror":"https://ror.org/05f11g639","country_code":"IN","type":"education","lineage":["https://openalex.org/I64189192"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"Tushar Bisht","raw_affiliation_strings":["International Institute of Information Technology, Hyderabad, Hyderabad, Andhra Pradesh, India","Int. Inst. of Inf. Technol., Hyderabad, India"],"affiliations":[{"raw_affiliation_string":"International Institute of Information Technology, Hyderabad, Hyderabad, Andhra Pradesh, India","institution_ids":["https://openalex.org/I64189192"]},{"raw_affiliation_string":"Int. Inst. of Inf. Technol., Hyderabad, India","institution_ids":["https://openalex.org/I64189192"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5023412602","display_name":"Kishore Kothapalli","orcid":"https://orcid.org/0000-0001-5523-4494"},"institutions":[{"id":"https://openalex.org/I64189192","display_name":"International Institute of Information Technology, Hyderabad","ror":"https://ror.org/05f11g639","country_code":"IN","type":"education","lineage":["https://openalex.org/I64189192"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Kishore Kothapalli","raw_affiliation_strings":["International Institute of Information Technology, Hyderabad, Hyderabad, Andhra Pradesh, India","Int. Inst. of Inf. Technol., Hyderabad, India"],"affiliations":[{"raw_affiliation_string":"International Institute of Information Technology, Hyderabad, Hyderabad, Andhra Pradesh, India","institution_ids":["https://openalex.org/I64189192"]},{"raw_affiliation_string":"Int. Inst. of Inf. Technol., Hyderabad, India","institution_ids":["https://openalex.org/I64189192"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5078248126"],"corresponding_institution_ids":["https://openalex.org/I64189192"],"apc_list":null,"apc_paid":null,"fwci":0.3625,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.61709509,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"24","last_page":"28"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9998999834060669,"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"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9998999834060669,"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/T10237","display_name":"Cryptography and Data Security","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T12288","display_name":"Optimization and Search Problems","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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.6858963966369629},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.6853086948394775},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.626880407333374},{"id":"https://openalex.org/keywords/implementation","display_name":"Implementation","score":0.5911231637001038},{"id":"https://openalex.org/keywords/maximal-independent-set","display_name":"Maximal independent set","score":0.4732033610343933},{"id":"https://openalex.org/keywords/distributed-algorithm","display_name":"Distributed algorithm","score":0.4696993827819824},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.44156506657600403},{"id":"https://openalex.org/keywords/random-graph","display_name":"Random graph","score":0.43763267993927},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.332247793674469},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.19774019718170166},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.16505369544029236}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6858963966369629},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.6853086948394775},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.626880407333374},{"id":"https://openalex.org/C26713055","wikidata":"https://www.wikidata.org/wiki/Q245962","display_name":"Implementation","level":2,"score":0.5911231637001038},{"id":"https://openalex.org/C18359143","wikidata":"https://www.wikidata.org/wiki/Q7888149","display_name":"Maximal independent set","level":5,"score":0.4732033610343933},{"id":"https://openalex.org/C130120984","wikidata":"https://www.wikidata.org/wiki/Q2835898","display_name":"Distributed algorithm","level":2,"score":0.4696993827819824},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.44156506657600403},{"id":"https://openalex.org/C47458327","wikidata":"https://www.wikidata.org/wiki/Q910404","display_name":"Random graph","level":3,"score":0.43763267993927},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.332247793674469},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.19774019718170166},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.16505369544029236},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/adcons.2013.9","is_oa":false,"landing_page_url":"https://doi.org/10.1109/adcons.2013.9","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 2nd International Conference on Advanced Computing, Networking and Security","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":6,"referenced_works":["https://openalex.org/W1987125980","https://openalex.org/W1997707549","https://openalex.org/W2100061495","https://openalex.org/W2132022337","https://openalex.org/W2149652607","https://openalex.org/W3022296711"],"related_works":["https://openalex.org/W2371352078","https://openalex.org/W2953461625","https://openalex.org/W1966320878","https://openalex.org/W3017886897","https://openalex.org/W3167778307","https://openalex.org/W9203110","https://openalex.org/W2058511514","https://openalex.org/W2168519036","https://openalex.org/W4299994946","https://openalex.org/W4288281541"],"abstract_inverted_index":{"Distributed":[0],"algorithms":[1,37,97],"for":[2,38,53],"computing":[3],"a":[4,9,60,87,104,125,141],"maximal":[5],"independent":[6],"set":[7],"of":[8,23,77,80,95,113,116,127,151,157],"graph":[10],"have":[11,32,49],"been":[12],"very":[13,69],"popular":[14],"in":[15,55,84,148],"the":[16,21,56,74,78,96,114,138,146,149,155],"research":[17],"community.":[18],"Starting":[19],"with":[20,41,59],"algorithm":[22,52,66,79,115,153],"Luby":[24,81,117],"dating":[25],"back":[26],"to":[27,144],"25":[28],"years,":[29],"several":[30],"researchers":[31],"focused":[33],"on":[34,92,124],"distributed":[35,57],"MIS":[36,54,147],"general":[39],"graphs.":[40,132],"little":[42,70],"success.":[43],"Only":[44],"recently,":[45],"M'etevier":[46,83,119],"et":[47],"al.":[48],"proposed":[50],"an":[51],"setting":[58],"round":[61],"complexity":[62],"that":[63,98,140],"matches":[64],"Luby's":[65,152],"asymptotically.":[67],"However,":[68],"is":[71],"known":[72],"about":[73],"relative":[75],"performance":[76],"and":[82,118,120,130],"practice.":[85],"Such":[86],"study":[88,121,135],"can":[89],"throw":[90],"light":[91],"some":[93],"aspects":[94],"are":[99],"not":[100],"brought":[101],"out":[102],"by":[103],"theoretical":[105],"analysis.":[106],"In":[107],"this":[108],"paper,":[109],"we":[110,134],"compare":[111],"implementations":[112],"their":[122],"behavior":[123],"class":[126],"random":[128],"graphs":[129],"bipartite":[131],"Further,":[133],"how":[136],"varying":[137],"probability":[139],"node":[142],"wishes":[143],"join":[145],"case":[150],"affects":[154],"number":[156],"rounds":[158],"required.":[159]},"counts_by_year":[{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}