{"id":"https://openalex.org/W4293317470","doi":"https://doi.org/10.1007/s00236-022-00421-5","title":"Exploration of k-edge-deficient temporal graphs","display_name":"Exploration of k-edge-deficient temporal graphs","publication_year":2022,"publication_date":"2022-08-01","ids":{"openalex":"https://openalex.org/W4293317470","doi":"https://doi.org/10.1007/s00236-022-00421-5"},"language":"en","primary_location":{"id":"doi:10.1007/s00236-022-00421-5","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00236-022-00421-5","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00236-022-00421-5.pdf","source":{"id":"https://openalex.org/S84409463","display_name":"Acta Informatica","issn_l":"0001-5903","issn":["0001-5903","1432-0525"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Acta Informatica","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/s00236-022-00421-5.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5049579750","display_name":"Thomas Erlebach","orcid":"https://orcid.org/0000-0002-4470-5868"},"institutions":[{"id":"https://openalex.org/I190082696","display_name":"Durham University","ror":"https://ror.org/01v29qb04","country_code":"GB","type":"education","lineage":["https://openalex.org/I190082696"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Thomas Erlebach","raw_affiliation_strings":["Department of Computer Science, Durham University, Durham, England"],"raw_orcid":"https://orcid.org/0000-0002-4470-5868","affiliations":[{"raw_affiliation_string":"Department of Computer Science, Durham University, Durham, England","institution_ids":["https://openalex.org/I190082696"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5033335424","display_name":"Jakob T. Spooner","orcid":"https://orcid.org/0000-0003-3816-6308"},"institutions":[{"id":"https://openalex.org/I153648349","display_name":"University of Leicester","ror":"https://ror.org/04h699437","country_code":"GB","type":"education","lineage":["https://openalex.org/I153648349"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Jakob T. Spooner","raw_affiliation_strings":["School of Computing and Mathematical Sciences, University of Leicester, Leicester, England"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Computing and Mathematical Sciences, University of Leicester, Leicester, England","institution_ids":["https://openalex.org/I153648349"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5049579750"],"corresponding_institution_ids":["https://openalex.org/I190082696"],"apc_list":{"value":2390,"currency":"EUR","value_usd":2990},"apc_paid":{"value":2390,"currency":"EUR","value_usd":2990},"fwci":0.2849,"has_fulltext":true,"cited_by_count":3,"citation_normalized_percentile":{"value":0.5771474,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"59","issue":"4","first_page":"387","last_page":"407"},"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.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"}},"topics":[{"id":"https://openalex.org/T11896","display_name":"Opportunistic and Delay-Tolerant Networks","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/T11478","display_name":"Caching and Content Delivery","score":0.9348999857902527,"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/T11980","display_name":"Human Mobility and Location-Based Analysis","score":0.9271000027656555,"subfield":{"id":"https://openalex.org/subfields/3313","display_name":"Transportation"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5565377473831177},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5453407764434814},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5450600981712341},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.45981156826019287},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.38882607221603394},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.05383738875389099}],"concepts":[{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5565377473831177},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5453407764434814},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5450600981712341},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.45981156826019287},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.38882607221603394},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.05383738875389099}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1007/s00236-022-00421-5","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00236-022-00421-5","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00236-022-00421-5.pdf","source":{"id":"https://openalex.org/S84409463","display_name":"Acta Informatica","issn_l":"0001-5903","issn":["0001-5903","1432-0525"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Acta Informatica","raw_type":"journal-article"},{"id":"pmh:oai:dro.dur.ac.uk.OAI2:35666","is_oa":true,"landing_page_url":"http://dro.dur.ac.uk/35666/","pdf_url":null,"source":{"id":"https://openalex.org/S4377196258","display_name":"Durham Research Online (Durham University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I190082696","host_organization_name":"Durham University","host_organization_lineage":["https://openalex.org/I190082696"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":"Acta Informatica, 2022, Vol.59(4), pp.387-407 [Peer Reviewed Journal]","raw_type":"Article"},{"id":"pmh:oai:durham-repository.worktribe.com:1210332","is_oa":true,"landing_page_url":"https://durham-repository.worktribe.com/output/1210332","pdf_url":null,"source":{"id":"https://openalex.org/S4306400188","display_name":"Durham Research Online (Durham University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I190082696","host_organization_name":"Durham University","host_organization_lineage":["https://openalex.org/I190082696"],"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":"","raw_type":"Journal Article"}],"best_oa_location":{"id":"doi:10.1007/s00236-022-00421-5","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00236-022-00421-5","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00236-022-00421-5.pdf","source":{"id":"https://openalex.org/S84409463","display_name":"Acta Informatica","issn_l":"0001-5903","issn":["0001-5903","1432-0525"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Acta Informatica","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2081710534","display_name":"Algorithmic Support for Massive Scale Distributed Systems","funder_award_id":"EP/T01461X/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"},{"id":"https://openalex.org/G2650624950","display_name":null,"funder_award_id":"EP/S033483/2","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"},{"id":"https://openalex.org/G3448245257","display_name":null,"funder_award_id":"EP/S033483/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"},{"id":"https://openalex.org/G4537582722","display_name":null,"funder_award_id":"EP/T01461X/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"},{"id":"https://openalex.org/G6402544442","display_name":"Algorithms for Computing with Uncertainty: Theory and Experiments","funder_award_id":"EP/S033483/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":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4293317470.pdf","grobid_xml":"https://content.openalex.org/works/W4293317470.grobid-xml"},"referenced_works_count":21,"referenced_works":["https://openalex.org/W25440674","https://openalex.org/W1746637951","https://openalex.org/W1881841366","https://openalex.org/W1984196269","https://openalex.org/W1996575062","https://openalex.org/W1996896896","https://openalex.org/W2004604480","https://openalex.org/W2092866491","https://openalex.org/W2330664568","https://openalex.org/W2889043416","https://openalex.org/W2898312999","https://openalex.org/W2949263370","https://openalex.org/W2963986371","https://openalex.org/W2965922572","https://openalex.org/W2968468046","https://openalex.org/W3010704749","https://openalex.org/W3034718415","https://openalex.org/W3044233549","https://openalex.org/W3192232263","https://openalex.org/W3199947862","https://openalex.org/W4372128997"],"related_works":["https://openalex.org/W2748952813","https://openalex.org/W2051487156","https://openalex.org/W2073681303","https://openalex.org/W2390279801","https://openalex.org/W2358668433","https://openalex.org/W2376932109","https://openalex.org/W2001405890","https://openalex.org/W2382290278","https://openalex.org/W2350741829","https://openalex.org/W2530322880"],"abstract_inverted_index":{"Abstract":[0],"A":[1],"temporal":[2,73,112,116,137,145,178,205,218],"graph":[3,52,55,74],"with":[4,56,147],"lifetime":[5,149],"L":[6,11],"is":[7,53,75,81,87,114],"a":[8,82,105,111,115],"sequence":[9],"of":[10,36,100,135],"graphs":[12,146,179],"$$G_1,":[13],"\\ldots":[14],",G_L$$":[15],"<mml:math":[16,158,189],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\">":[17,159,190],"<mml:mrow>":[18,160,191],"<mml:msub>":[19,26],"<mml:mi>G</mml:mi>":[20,27],"<mml:mn>1</mml:mn>":[21],"</mml:msub>":[22,29],"<mml:mo>,</mml:mo>":[23,25],"<mml:mo>\u2026</mml:mo>":[24],"<mml:mi>L</mml:mi>":[28],"</mml:mrow>":[30,168,198],"</mml:math>":[31,169,199],",":[32,110,122],"called":[33],"layers,":[34],"all":[35,62,94,133],"which":[37,181],"have":[38,46],"the":[39,54,63,101,136],"same":[40],"vertex":[41,57,108],"set":[42,58],"V":[43,59],"but":[44],"can":[45,150],"different":[47],"edge":[48,127],"sets.":[49],"The":[50,72],"underlying":[51,102],"that":[60,65,118,141,209],"contains":[61,93],"edges":[64,99],"appear":[66],"in":[67,128,154],"at":[68,96,120,124],"least":[69],"one":[70,126],"layer.":[71],"always":[76,151],"connected":[77,83],"if":[78,90],"each":[79,91,129],"layer":[80,92],"graph,":[84],"and":[85,131],"it":[86],"k":[88,98,143,176],"-edge-deficient":[89,144,177],"except":[95],"most":[97,125],"graph.":[103,138],"For":[104,202],"given":[106],"start":[107],"s":[109,121],"exploration":[113,183],"walk":[117],"starts":[119],"traverses":[123],"layer,":[130],"visits":[132],"vertices":[134],"We":[139,172],"show":[140,208],"always-connected,":[142,175,203],"sufficient":[148],"be":[152],"explored":[153],"$$O(kn":[155],"\\log":[156,187],"n)$$":[157],"<mml:mi>O</mml:mi>":[161],"<mml:mo>(</mml:mo>":[162,193],"<mml:mi>k</mml:mi>":[163,196],"<mml:mi>n</mml:mi>":[164,166,194],"<mml:mo>log</mml:mo>":[165,195],"<mml:mo>)</mml:mo>":[167,197],"time":[170,200,214],"steps.":[171,201],"also":[173],"construct":[174],"for":[180,217],"any":[182],"requires":[184],"$$\\varOmega":[185],"(n":[186],"k)$$":[188],"<mml:mi>\u03a9</mml:mi>":[192],"1-edge-deficient":[204],"graphs,":[206],"we":[207],"O":[210],"(":[211],"n":[212],")":[213],"steps":[215],"suffice":[216],"exploration.":[219]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}