{"id":"https://openalex.org/W7165785988","doi":"https://doi.org/10.4230/lipics.sand.2026.20","title":"Brief Announcement: Exploration of Always S-Connected Temporal Graphs","display_name":"Brief Announcement: Exploration of Always S-Connected Temporal Graphs","publication_year":2026,"publication_date":"2026-01-01","ids":{"openalex":"https://openalex.org/W7165785988","doi":"https://doi.org/10.4230/lipics.sand.2026.20"},"language":"en","primary_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:26254","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAND.2026.20","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol373-sand2026/LIPIcs.SAND.2026.20/LIPIcs.SAND.2026.20.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"InProceedings"},"type":"article","indexed_in":["datacite","doaj"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol373-sand2026/LIPIcs.SAND.2026.20/LIPIcs.SAND.2026.20.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5079233279","display_name":"Duncan Adamson","orcid":"https://orcid.org/0000-0003-3343-2435"},"institutions":[{"id":"https://openalex.org/I16835326","display_name":"University of St Andrews","ror":"https://ror.org/02wn5qz54","country_code":"GB","type":"education","lineage":["https://openalex.org/I16835326"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Adamson, Duncan","raw_affiliation_strings":["Department of Computer Science, University of St Andrews, UK"],"raw_orcid":"https://orcid.org/0000-0003-3343-2435","affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of St Andrews, UK","institution_ids":["https://openalex.org/I16835326"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5011756177","display_name":"Paul G. Spirakis","orcid":"https://orcid.org/0000-0001-5396-3749"},"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":"Spirakis, Paul G","raw_affiliation_strings":["School of Computer Science and Informatics, University of Liverpool, UK"],"raw_orcid":"https://orcid.org/0000-0001-5396-3749","affiliations":[{"raw_affiliation_string":"School of Computer Science and Informatics, University of Liverpool, UK","institution_ids":["https://openalex.org/I146655781"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.67752358,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11896","display_name":"Opportunistic and Delay-Tolerant Networks","score":0.9804999828338623,"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/T11896","display_name":"Opportunistic and Delay-Tolerant Networks","score":0.9804999828338623,"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.004900000058114529,"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/T12288","display_name":"Optimization and Search Problems","score":0.0020000000949949026,"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/subnetwork","display_name":"Subnetwork","score":0.5511000156402588},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5432999730110168},{"id":"https://openalex.org/keywords/treewidth","display_name":"Treewidth","score":0.5302000045776367},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4986000061035156},{"id":"https://openalex.org/keywords/traverse","display_name":"Traverse","score":0.4869000017642975},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.36809998750686646},{"id":"https://openalex.org/keywords/independent-set","display_name":"Independent set","score":0.3303999900817871},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.31700000166893005}],"concepts":[{"id":"https://openalex.org/C2780186347","wikidata":"https://www.wikidata.org/wiki/Q11414","display_name":"Subnetwork","level":2,"score":0.5511000156402588},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5432999730110168},{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.5302000045776367},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4986000061035156},{"id":"https://openalex.org/C176809094","wikidata":"https://www.wikidata.org/wiki/Q15401496","display_name":"Traverse","level":2,"score":0.4869000017642975},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4553999900817871},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4480000138282776},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4260999858379364},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3912999927997589},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.36809998750686646},{"id":"https://openalex.org/C122818955","wikidata":"https://www.wikidata.org/wiki/Q1060343","display_name":"Independent set","level":3,"score":0.3303999900817871},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.32690000534057617},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.31700000166893005},{"id":"https://openalex.org/C8554925","wikidata":"https://www.wikidata.org/wiki/Q3893853","display_name":"Split graph","level":5,"score":0.2964000105857849},{"id":"https://openalex.org/C2775997480","wikidata":"https://www.wikidata.org/wiki/Q586277","display_name":"Degree (music)","level":2,"score":0.2957000136375427},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.28700000047683716},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.28630000352859497},{"id":"https://openalex.org/C13355873","wikidata":"https://www.wikidata.org/wiki/Q2920850","display_name":"Connection (principal bundle)","level":2,"score":0.28369998931884766},{"id":"https://openalex.org/C184898388","wikidata":"https://www.wikidata.org/wiki/Q1435712","display_name":"Pairwise comparison","level":2,"score":0.2696000039577484},{"id":"https://openalex.org/C18359143","wikidata":"https://www.wikidata.org/wiki/Q7888149","display_name":"Maximal independent set","level":5,"score":0.2624000012874603},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.2596000134944916},{"id":"https://openalex.org/C76444178","wikidata":"https://www.wikidata.org/wiki/Q72897900","display_name":"Connectivity","level":3,"score":0.25920000672340393},{"id":"https://openalex.org/C43413943","wikidata":"https://www.wikidata.org/wiki/Q4927193","display_name":"Block graph","level":5,"score":0.25290000438690186},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.2500999867916107}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:drops-oai.dagstuhl.de:26254","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAND.2026.20","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol373-sand2026/LIPIcs.SAND.2026.20/LIPIcs.SAND.2026.20.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"InProceedings"},{"id":"doi:10.4230/lipics.sand.2026.20","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.sand.2026.20","pdf_url":null,"source":{"id":"https://openalex.org/S4393917817","display_name":"Leibniz international proceedings in informatics","issn_l":"1868-8969","issn":["1868-8969"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"ConferencePaper"}],"best_oa_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:26254","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAND.2026.20","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol373-sand2026/LIPIcs.SAND.2026.20/LIPIcs.SAND.2026.20.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"InProceedings"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7165785988.pdf","grobid_xml":"https://content.openalex.org/works/W7165785988.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Temporal":[0],"graphs":[1,83,123],"are":[2,27],"a":[3,10,15,20,43,62,78,88,137,151,155,196,214],"generalisation":[4,79],"of":[5,12,23,29,45,80,119,127,140,158,177],"(static)":[6],"graphs,":[7,40,77,130],"defined":[8,18,102],"by":[9,103,182,213],"sequence":[11],"snapshots,":[13,190],"each":[14,56,93,101],"static":[16],"graph":[17,168,204],"over":[19],"common":[21],"set":[22,44,113],"vertices.":[24],"Exploration":[25],"problems":[26,37],"one":[28,109],"the":[30,53,104,112,117],"most":[31,34,98,208],"fundamental":[32],"and":[33,72,173],"heavily":[35],"studied":[36],"on":[38],"temporal":[39,76,82,122,129,167,203],"asking":[41],"if":[42],"m":[46,170,183],"agents":[47,184],"can":[48,179,210],"visit":[49],"every":[50],"vertex":[51,110],"in":[52,92,111,185,217],"graph,":[54],"with":[55,131,136,169,205],"agent":[57,216],"only":[58],"allowed":[59],"to":[60,106,124],"traverse":[61],"single":[63,89,215],"edge":[64],"per":[65],"snapshot.":[66],"In":[67],"this":[68,193],"paper,":[69],"we":[70,95,198],"introduce":[71],"study":[73,125],"always":[74,120,165],"S-connected":[75,121,166],"always-connected":[81,128,202],"where,":[84],"rather":[85],"than":[86],"forming":[87],"connected":[90],"component":[91],"snapshot,":[94],"have":[96],"at":[97,107,207],"|S|":[99,172],"components,":[100],"connection":[105],"least":[108],"S.":[114],"We":[115,161],"use":[116],"model":[118],"subgraphs":[126],"motivation":[132],"coming":[133],"from":[134,154],"networks":[135],"small":[138],"number":[139,157],"\"choke-points\",":[141],"such":[142],"as":[143,195],"rail":[144],"networks,":[145],"where":[146],"all":[147],"external":[148,159],"traffic":[149],"into":[150],"subnetwork":[152],"comes":[153],"limited":[156],"connections.":[160],"show":[162,199],"that":[163,200],"an":[164,174],"=":[171],"average":[175],"degree":[176],"\u0394":[178],"be":[180,211],"explored":[181,212],"O(n^{3/2}":[186],"m\u00b3":[187],"\u0394^{3/2}":[188],"log^{3/2}(n))":[189],"and,":[191],"using":[192],"result":[194],"subroutine,":[197],"any":[201],"treewidth":[206],"k":[209],"O(n^{4/3}":[218],"k^{11/2}":[219],"log^{5/2}(n))":[220],"snapshots.":[221]},"counts_by_year":[],"updated_date":"2026-08-18T07:49:30.821534","created_date":"2026-06-25T00:00:00"}