{"id":"https://openalex.org/W2022437016","doi":"https://doi.org/10.1142/s1793830911001346","title":"TIME OPTIMAL ALGORITHMS FOR BLACK HOLE SEARCH IN RINGS","display_name":"TIME OPTIMAL ALGORITHMS FOR BLACK HOLE SEARCH IN RINGS","publication_year":2011,"publication_date":"2011-12-01","ids":{"openalex":"https://openalex.org/W2022437016","doi":"https://doi.org/10.1142/s1793830911001346","mag":"2022437016"},"language":"en","primary_location":{"id":"doi:10.1142/s1793830911001346","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s1793830911001346","pdf_url":null,"source":{"id":"https://openalex.org/S178434951","display_name":"Discrete Mathematics Algorithms and Applications","issn_l":"1793-8309","issn":["1793-8309","1793-8317"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete Mathematics, Algorithms and Applications","raw_type":"journal-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/A5038390285","display_name":"Balasingham Balamohan","orcid":null},"institutions":[{"id":"https://openalex.org/I153718931","display_name":"University of Ottawa","ror":"https://ror.org/03c4mmv16","country_code":"CA","type":"education","lineage":["https://openalex.org/I153718931"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"B. BALAMOHAN","raw_affiliation_strings":["School of Electrical Engineering and Computer Science, University of Ottawa, Ottawa, Ontario, Canada","[School of Electrical Engineering and Computer Science, University of Ottawa, Ottawa, Ontario, Canada]"],"affiliations":[{"raw_affiliation_string":"School of Electrical Engineering and Computer Science, University of Ottawa, Ottawa, Ontario, Canada","institution_ids":["https://openalex.org/I153718931"]},{"raw_affiliation_string":"[School of Electrical Engineering and Computer Science, University of Ottawa, Ottawa, Ontario, Canada]","institution_ids":["https://openalex.org/I153718931"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5030360680","display_name":"Paola Flocchini","orcid":"https://orcid.org/0000-0003-3584-5727"},"institutions":[{"id":"https://openalex.org/I153718931","display_name":"University of Ottawa","ror":"https://ror.org/03c4mmv16","country_code":"CA","type":"education","lineage":["https://openalex.org/I153718931"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"P. FLOCCHINI","raw_affiliation_strings":["School of Electrical Engineering and Computer Science, University of Ottawa, Ottawa, Ontario, Canada","[School of Electrical Engineering and Computer Science, University of Ottawa, Ottawa, Ontario, Canada]"],"affiliations":[{"raw_affiliation_string":"School of Electrical Engineering and Computer Science, University of Ottawa, Ottawa, Ontario, Canada","institution_ids":["https://openalex.org/I153718931"]},{"raw_affiliation_string":"[School of Electrical Engineering and Computer Science, University of Ottawa, Ottawa, Ontario, Canada]","institution_ids":["https://openalex.org/I153718931"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101564148","display_name":"Ali Miri","orcid":"https://orcid.org/0000-0001-5991-7188"},"institutions":[{"id":"https://openalex.org/I530967","display_name":"Toronto Metropolitan University","ror":"https://ror.org/05g13zd79","country_code":"CA","type":"education","lineage":["https://openalex.org/I530967"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"A. MIRI","raw_affiliation_strings":["Department of Computer Science, Ryerson University, Toronto, Ontario, Canada","Department of Computer Science , Ryerson University , Toronto, Ontario, Canada"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Ryerson University, Toronto, Ontario, Canada","institution_ids":["https://openalex.org/I530967"]},{"raw_affiliation_string":"Department of Computer Science , Ryerson University , Toronto, Ontario, Canada","institution_ids":["https://openalex.org/I530967"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5044260252","display_name":"Nicola Santoro","orcid":"https://orcid.org/0000-0002-7954-3918"},"institutions":[{"id":"https://openalex.org/I67031392","display_name":"Carleton University","ror":"https://ror.org/02qtvee93","country_code":"CA","type":"education","lineage":["https://openalex.org/I67031392"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"N. SANTORO","raw_affiliation_strings":["School of Computer Science, Carleton University, Ottawa, Ontario, Canada","[School of Computer Science, Carleton University, Ottawa, Ontario, Canada]"],"affiliations":[{"raw_affiliation_string":"School of Computer Science, Carleton University, Ottawa, Ontario, Canada","institution_ids":["https://openalex.org/I67031392"]},{"raw_affiliation_string":"[School of Computer Science, Carleton University, Ottawa, Ontario, Canada]","institution_ids":["https://openalex.org/I67031392"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5038390285"],"corresponding_institution_ids":["https://openalex.org/I153718931"],"apc_list":null,"apc_paid":null,"fwci":2.558,"has_fulltext":false,"cited_by_count":18,"citation_normalized_percentile":{"value":0.8960127,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"03","issue":"04","first_page":"457","last_page":"471"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":1.0,"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"}},"topics":[{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":1.0,"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"}},{"id":"https://openalex.org/T12203","display_name":"Mobile Agent-Based Network Management","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"}},{"id":"https://openalex.org/T10772","display_name":"Distributed systems and fault tolerance","score":0.9980999827384949,"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/asynchronous-communication","display_name":"Asynchronous communication","score":0.6144909262657166},{"id":"https://openalex.org/keywords/focus","display_name":"Focus (optics)","score":0.5740855932235718},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5603026747703552},{"id":"https://openalex.org/keywords/black-hole","display_name":"Black hole (networking)","score":0.5462710857391357},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5011050701141357},{"id":"https://openalex.org/keywords/ring","display_name":"Ring (chemistry)","score":0.47602325677871704},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4674661457538605},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.44127020239830017},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.32653313875198364},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.11932983994483948},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.10511988401412964},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.09328433871269226},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.0897623598575592}],"concepts":[{"id":"https://openalex.org/C151319957","wikidata":"https://www.wikidata.org/wiki/Q752739","display_name":"Asynchronous communication","level":2,"score":0.6144909262657166},{"id":"https://openalex.org/C192209626","wikidata":"https://www.wikidata.org/wiki/Q190909","display_name":"Focus (optics)","level":2,"score":0.5740855932235718},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5603026747703552},{"id":"https://openalex.org/C50341732","wikidata":"https://www.wikidata.org/wiki/Q880302","display_name":"Black hole (networking)","level":5,"score":0.5462710857391357},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5011050701141357},{"id":"https://openalex.org/C2780378348","wikidata":"https://www.wikidata.org/wiki/Q25351438","display_name":"Ring (chemistry)","level":2,"score":0.47602325677871704},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4674661457538605},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.44127020239830017},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.32653313875198364},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.11932983994483948},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.10511988401412964},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.09328433871269226},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0897623598575592},{"id":"https://openalex.org/C89305328","wikidata":"https://www.wikidata.org/wiki/Q1755411","display_name":"Link-state routing protocol","level":4,"score":0.0},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.0},{"id":"https://openalex.org/C178790620","wikidata":"https://www.wikidata.org/wiki/Q11351","display_name":"Organic chemistry","level":1,"score":0.0},{"id":"https://openalex.org/C120665830","wikidata":"https://www.wikidata.org/wiki/Q14620","display_name":"Optics","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C201995342","wikidata":"https://www.wikidata.org/wiki/Q682496","display_name":"Systems engineering","level":1,"score":0.0},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1142/s1793830911001346","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s1793830911001346","pdf_url":null,"source":{"id":"https://openalex.org/S178434951","display_name":"Discrete Mathematics Algorithms and Applications","issn_l":"1793-8309","issn":["1793-8309","1793-8317"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete Mathematics, Algorithms and Applications","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.304.3315","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.304.3315","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.scs.carleton.ca/%7Esantoro/Reports/COCOA.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.658.2216","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.658.2216","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.site.uottawa.ca/%7Eflocchin/Papers/COCOA2010.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320334593","display_name":"Natural Sciences and Engineering Research Council of Canada","ror":"https://ror.org/01h531d29"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W575426582","https://openalex.org/W1534484868","https://openalex.org/W1984719907","https://openalex.org/W2011421072","https://openalex.org/W2039936247","https://openalex.org/W2047087577","https://openalex.org/W2098103684","https://openalex.org/W2130524435","https://openalex.org/W2163097371","https://openalex.org/W2755903365","https://openalex.org/W4214492366","https://openalex.org/W4235736160","https://openalex.org/W4256624975"],"related_works":["https://openalex.org/W3014436429","https://openalex.org/W2147711412","https://openalex.org/W2989826110","https://openalex.org/W2367372208","https://openalex.org/W2006363920","https://openalex.org/W2521877348","https://openalex.org/W2475836838","https://openalex.org/W3100791781","https://openalex.org/W2776953575","https://openalex.org/W1548344605"],"abstract_inverted_index":{"In":[0,66,140],"a":[1,11,15,36,98,119],"network":[2],"environment":[3],"supporting":[4],"mobile":[5,42],"entities":[6],"(called":[7],"robots":[8],"or":[9],"agents),":[10],"black":[12,64,72],"hole":[13,73],"is":[14,32,89],"harmful":[16],"site":[17],"that":[18,91,177,205,231],"destroys":[19],"any":[20,25,92],"incoming":[21],"entity":[22],"without":[23,190],"leaving":[24],"visible":[26],"trace.":[27],"The":[28,111],"black-hole":[29,95],"search":[30,74,96],"problit":[31,75,164],"the":[33,46,52,60,63,71,108,137,147,158,163,172,178,192,228],"task":[34],"of":[35,38,62,80,121,131,150,183,220],"team":[37,120,219],"k":[39,221],">":[40],"1":[41,124],"entities,":[43],"starting":[44],"from":[45],"same":[47,53,148],"safe":[48],"location":[49,61],"and":[50,83,211],"executing":[51],"algorithm,":[54],"to":[55,136],"determine":[56],"within":[57],"finite":[58],"time":[59,86,106,129,155,170,214],"hole.":[65],"this":[67,116,141],"paper,":[68,142],"we":[69,143,201],"consider":[70],"in":[76,97,107,157,165],"asynchronous":[77],"ring":[78,99],"networks":[79],"n":[81,122],"nodes,":[82],"focus":[84],"on":[85,171,227],"complexity.":[87],"It":[88],"known":[90,113],"algorithm":[93,114,204],"for":[94],"requires":[100],"at":[101],"least":[102],"2(n":[103,132,196],"-":[104,123,133,197],"2)":[105],"worst":[109,138,159,193,210],"case.":[110,139],"best":[112],"achieves":[115,206],"bound":[117],"with":[118,126],"agents":[125,151],"an":[127,203,217],"average":[128,180,212],"cost":[130],"2),":[134],"equal":[135],"first":[144],"show":[145],"how":[146],"number":[149],"using":[152,195],"2":[153,223],"extra":[154],"units":[156],"case,":[160],"can":[161,187],"solve":[162],"only":[166],"[Formula:":[167,184],"see":[168,185],"text]":[169,186],"average.":[173],"We":[174],"then":[175],"prove":[176],"optimal":[179,208,218],"case":[181,194,213],"complexity":[182],"be":[188],"achieved":[189],"increasing":[191],"1)":[198],"agents.":[199,234],"Finally,":[200],"design":[202],"asymptotically":[207],"both":[209],"complexities":[215],"itploying":[216],"=":[222],"agents,":[224],"thus":[225],"improving":[226],"earlier":[229],"results":[230],"required":[232],"O(n)":[233]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":4}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}