{"id":"https://openalex.org/W3211862663","doi":"https://doi.org/10.1142/s0129626421500201","title":"Beyond Rings: Gathering in 1-Interval Connected Graphs","display_name":"Beyond Rings: Gathering in 1-Interval Connected Graphs","publication_year":2021,"publication_date":"2021-11-10","ids":{"openalex":"https://openalex.org/W3211862663","doi":"https://doi.org/10.1142/s0129626421500201","mag":"3211862663"},"language":"en","primary_location":{"id":"doi:10.1142/s0129626421500201","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129626421500201","pdf_url":null,"source":{"id":"https://openalex.org/S18360026","display_name":"Parallel Processing Letters","issn_l":"0129-6264","issn":["0129-6264","1793-642X"],"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":"Parallel Processing Letters","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/A5002991731","display_name":"Othon Michail","orcid":"https://orcid.org/0000-0002-6234-3960"},"institutions":[{"id":"https://openalex.org/I146655781","display_name":"University of Liverpool","ror":"https://ror.org/04xs57h96","country_code":"GB","type":"education","lineage":["https://openalex.org/I146655781"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Othon Michail","raw_affiliation_strings":["Department of Computer Science, University of Liverpool, UK"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Liverpool, UK","institution_ids":["https://openalex.org/I146655781"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5011756177","display_name":"Paul G. Spirakis","orcid":"https://orcid.org/0000-0001-5396-3749"},"institutions":[{"id":"https://openalex.org/I174878644","display_name":"University of Patras","ror":"https://ror.org/017wvtq80","country_code":"GR","type":"education","lineage":["https://openalex.org/I174878644"]},{"id":"https://openalex.org/I146655781","display_name":"University of Liverpool","ror":"https://ror.org/04xs57h96","country_code":"GB","type":"education","lineage":["https://openalex.org/I146655781"]}],"countries":["GB","GR"],"is_corresponding":false,"raw_author_name":"Paul G. Spirakis","raw_affiliation_strings":["Computer Engineering and Informatics Department, University of Patras, Greece","Department of Computer Science, University of Liverpool, UK"],"affiliations":[{"raw_affiliation_string":"Computer Engineering and Informatics Department, University of Patras, Greece","institution_ids":["https://openalex.org/I174878644"]},{"raw_affiliation_string":"Department of Computer Science, University of Liverpool, UK","institution_ids":["https://openalex.org/I146655781"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5000106745","display_name":"Michail Theofilatos","orcid":"https://orcid.org/0000-0002-3699-0179"},"institutions":[{"id":"https://openalex.org/I146655781","display_name":"University of Liverpool","ror":"https://ror.org/04xs57h96","country_code":"GB","type":"education","lineage":["https://openalex.org/I146655781"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Michail Theofilatos","raw_affiliation_strings":["Department of Computer Science, University of Liverpool, UK"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Liverpool, UK","institution_ids":["https://openalex.org/I146655781"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5000106745"],"corresponding_institution_ids":["https://openalex.org/I146655781"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.19608528,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"31","issue":"04","first_page":null,"last_page":null},"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/T10772","display_name":"Distributed systems and fault tolerance","score":0.9991999864578247,"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.9829000234603882,"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/combinatorics","display_name":"Combinatorics","score":0.6317380666732788},{"id":"https://openalex.org/keywords/rendezvous","display_name":"Rendezvous","score":0.5297307372093201},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4906574785709381},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.48821714520454407},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4828541874885559},{"id":"https://openalex.org/keywords/connected-component","display_name":"Connected component","score":0.45543867349624634},{"id":"https://openalex.org/keywords/interval","display_name":"Interval (graph theory)","score":0.4511619210243225},{"id":"https://openalex.org/keywords/clique","display_name":"Clique","score":0.4211428165435791},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4193256199359894},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3220962584018707}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6317380666732788},{"id":"https://openalex.org/C2779968344","wikidata":"https://www.wikidata.org/wiki/Q3932925","display_name":"Rendezvous","level":3,"score":0.5297307372093201},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4906574785709381},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.48821714520454407},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4828541874885559},{"id":"https://openalex.org/C193435613","wikidata":"https://www.wikidata.org/wiki/Q2997928","display_name":"Connected component","level":2,"score":0.45543867349624634},{"id":"https://openalex.org/C2778067643","wikidata":"https://www.wikidata.org/wiki/Q166507","display_name":"Interval (graph theory)","level":2,"score":0.4511619210243225},{"id":"https://openalex.org/C2777035058","wikidata":"https://www.wikidata.org/wiki/Q1662634","display_name":"Clique","level":2,"score":0.4211428165435791},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4193256199359894},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3220962584018707},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C29829512","wikidata":"https://www.wikidata.org/wiki/Q40218","display_name":"Spacecraft","level":2,"score":0.0},{"id":"https://openalex.org/C146978453","wikidata":"https://www.wikidata.org/wiki/Q3798668","display_name":"Aerospace engineering","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s0129626421500201","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129626421500201","pdf_url":null,"source":{"id":"https://openalex.org/S18360026","display_name":"Parallel Processing Letters","issn_l":"0129-6264","issn":["0129-6264","1793-642X"],"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":"Parallel Processing Letters","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G5260088266","display_name":"Algorithmic Aspects of Temporal Graphs","funder_award_id":"EP/P02002X/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"},{"id":"https://openalex.org/G6979527396","display_name":null,"funder_award_id":"EP/P02002X/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"}],"funders":[{"id":"https://openalex.org/F4320334627","display_name":"Engineering and Physical Sciences Research Council","ror":"https://ror.org/0439y7842"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W1517606437","https://openalex.org/W1600210399","https://openalex.org/W1746637951","https://openalex.org/W1981643246","https://openalex.org/W1983815693","https://openalex.org/W1988551609","https://openalex.org/W1988889787","https://openalex.org/W2049954052","https://openalex.org/W2050063944","https://openalex.org/W2080745503","https://openalex.org/W2621800709","https://openalex.org/W2914771821","https://openalex.org/W2951748104","https://openalex.org/W3017087724","https://openalex.org/W4231165118","https://openalex.org/W4400518895"],"related_works":["https://openalex.org/W2057371520","https://openalex.org/W2183620364","https://openalex.org/W2542862126","https://openalex.org/W2807763113","https://openalex.org/W2030068303","https://openalex.org/W1521763702","https://openalex.org/W2245527669","https://openalex.org/W937816491","https://openalex.org/W2965171438","https://openalex.org/W2951347506"],"abstract_inverted_index":{"We":[0,22,87,234],"examine":[1],"the":[2,27,69,75,80,91,98,120,128,141,152,162,169,204,209,217,224,228,232,240],"problem":[3,72,92,153,245],"of":[4,26,44,106,113,143,200,243,253],"gathering":[5,184],"[Formula:":[6,28,249],"see":[7,29,250],"text]":[8,251],"agents":[9,53,76,121,205],"(or":[10],"multi-agent":[11],"rendezvous)":[12],"in":[13,19,34,85,150,197,248],"dynamic":[14],"graphs":[15,146],"which":[16,35,151],"may":[17],"change":[18],"every":[20],"round.":[21],"consider":[23],"a":[24,50,102,110,173,236],"variant":[25],"text]-interval":[30],"connectivity":[31,181],"model":[32],"[9]":[33],"all":[36],"instances":[37,199],"(snapshots)":[38],"are":[39,54,64,122],"always":[40],"connected":[41,145],"spanning":[42,174],"subgraphs":[43],"an":[45,179,213],"underlying":[46,99,170],"graph,":[47],"not":[48,57,83],"necessarily":[49],"clique.":[51],"The":[52,71],"identical":[55],"and":[56,63,147,158,177,226],"equipped":[58],"with":[59,157],"explicit":[60],"communication":[61],"capabilities,":[62],"initially":[65],"arbitrarily":[66],"positioned":[67],"on":[68,191,208],"graph.":[70],"is":[73,138,154,185],"for":[74,239],"to":[77,95,124,139,216,222],"gather":[78,125],"at":[79,127,132],"same":[81,129],"node,":[82,130],"fixed":[84],"advance.":[86],"first":[88],"show":[89,166],"that":[90,167,230,246],"becomes":[93],"impossible":[94],"solve":[96],"if":[97],"graph":[100,171,225],"has":[101],"cycle.":[103,210,233],"In":[104],"light":[105],"this,":[107],"we":[108,165,188,195],"study":[109],"relaxed":[111],"version":[112],"this":[114,244],"problem,":[115,218],"called":[116],"weak":[117,183],"gathering,":[118],"where":[119],"allowed":[123],"either":[126],"or":[131],"two":[133],"adjacent":[134],"nodes.":[135],"Our":[136],"goal":[137],"characterize":[140],"class":[142],"1-interval":[144],"initial":[148,201],"configurations":[149],"solvable,":[155],"both":[156],"without":[159],"homebases.":[160],"On":[161],"negative":[163],"side":[164],"when":[168],"contains":[172],"bicyclic":[175],"subgraph":[176],"satisfies":[178],"additional":[180,214],"property,":[182],"unsolvable,":[186],"thus":[187],"concentrate":[189],"mainly":[190],"unicyclic":[192],"graphs.":[193],"As":[194],"show,":[196],"most":[198],"agent":[202],"configurations,":[203],"must":[206],"meet":[207],"This":[211],"adds":[212],"difficulty":[215],"as":[219],"they":[220],"need":[221],"explore":[223],"recognize":[227],"nodes":[229],"form":[231],"provide":[235],"deterministic":[237],"algorithm":[238],"solvable":[241],"cases":[242],"runs":[247],"number":[252],"rounds.":[254]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}