{"id":"https://openalex.org/W7161750575","doi":"https://doi.org/10.48550/arxiv.2605.17051","title":"Online Graph Embedding in Star Graphs","display_name":"Online Graph Embedding in Star Graphs","publication_year":2026,"publication_date":"2026-05-16","ids":{"openalex":"https://openalex.org/W7161750575","doi":"https://doi.org/10.48550/arxiv.2605.17051"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2605.17051","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.17051","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2605.17051","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5093836306","display_name":"Julien Dallot","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Dallot, Julien","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5136502075","display_name":"Darya Melnyk","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Melnyk, Darya","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5046854190","display_name":"Maciej Pacut","orcid":"https://orcid.org/0000-0002-6379-1490"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Pacut, Maciej","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5136483740","display_name":"Stefan Schmid","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Schmid, Stefan","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.3434000015258789,"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.3434000015258789,"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/T12288","display_name":"Optimization and Search Problems","score":0.13249999284744263,"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/T12292","display_name":"Graph Theory and Algorithms","score":0.1143999993801117,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/embedding","display_name":"Embedding","score":0.6802999973297119},{"id":"https://openalex.org/keywords/deterministic-algorithm","display_name":"Deterministic algorithm","score":0.5468000173568726},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5278000235557556},{"id":"https://openalex.org/keywords/graph-embedding","display_name":"Graph embedding","score":0.4968999922275543},{"id":"https://openalex.org/keywords/randomized-algorithm","display_name":"Randomized algorithm","score":0.4406000077724457},{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.4032000005245209},{"id":"https://openalex.org/keywords/host","display_name":"Host (biology)","score":0.40119999647140503},{"id":"https://openalex.org/keywords/competitive-analysis","display_name":"Competitive analysis","score":0.3878999948501587}],"concepts":[{"id":"https://openalex.org/C41608201","wikidata":"https://www.wikidata.org/wiki/Q980509","display_name":"Embedding","level":2,"score":0.6802999973297119},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5587999820709229},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5573999881744385},{"id":"https://openalex.org/C13533509","wikidata":"https://www.wikidata.org/wiki/Q1064349","display_name":"Deterministic algorithm","level":2,"score":0.5468000173568726},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5278000235557556},{"id":"https://openalex.org/C75564084","wikidata":"https://www.wikidata.org/wiki/Q5597085","display_name":"Graph embedding","level":3,"score":0.4968999922275543},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.4406000077724457},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.4032000005245209},{"id":"https://openalex.org/C126831891","wikidata":"https://www.wikidata.org/wiki/Q221673","display_name":"Host (biology)","level":2,"score":0.40119999647140503},{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.3878999948501587},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3434999883174896},{"id":"https://openalex.org/C106516650","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm design","level":2,"score":0.3409999907016754},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.3391999900341034},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.3262999951839447},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.321399986743927},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.32109999656677246},{"id":"https://openalex.org/C64339825","wikidata":"https://www.wikidata.org/wiki/Q722659","display_name":"Graph property","level":5,"score":0.3084000051021576},{"id":"https://openalex.org/C2777210771","wikidata":"https://www.wikidata.org/wiki/Q4927124","display_name":"Block (permutation group theory)","level":2,"score":0.30300000309944153},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.3009999990463257},{"id":"https://openalex.org/C2780897414","wikidata":"https://www.wikidata.org/wiki/Q7600592","display_name":"Star (game theory)","level":2,"score":0.2944999933242798},{"id":"https://openalex.org/C30609935","wikidata":"https://www.wikidata.org/wiki/Q7291969","display_name":"Random geometric graph","level":5,"score":0.29100000858306885},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.2784999907016754},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.27230000495910645},{"id":"https://openalex.org/C2986651925","wikidata":"https://www.wikidata.org/wiki/Q1514868","display_name":"Graph algorithms","level":3,"score":0.2529999911785126}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2605.17051","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.17051","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"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":"article"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2605.17051","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.17051","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},"sustainable_development_goals":[{"display_name":"Reduced inequalities","id":"https://metadata.un.org/sdg/10","score":0.7628343105316162}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Graph":[0],"embedding":[1,53,86,113],"is":[2,120,163],"a":[3,10,14,137,147,164,169],"fundamental":[4],"problem":[5,114],"of":[6,9,174,198],"mapping":[7],"nodes":[8],"guest":[11,46],"graph":[12,16,47,112],"into":[13,29],"host":[15,117,134],"while":[17],"minimizing":[18],"the":[19,45,52,91,110,126,179,182,196],"distance":[20],"distortion,":[21],"with":[22],"broad":[23],"applications,":[24],"including":[25],"virtual":[26,60],"network":[27,64],"embeddings":[28,67],"physical":[30],"topologies,":[31],"VLSI":[32],"design,":[33],"or":[34],"community":[35],"detection":[36],"in":[37,41,63,71,115],"social":[38],"networks.":[39],"However,":[40],"many":[42],"real-world":[43],"applications":[44],"changes":[48,58],"over":[49],"time":[50],"and":[51,105,140,151,181],"can":[54,157],"adapt":[55,89],"to":[56,73,83,90,128],"these":[57],"(e.g.":[59],"machine":[61],"migration":[62],"embeddings).":[65],"Static":[66],"are":[68,96,185],"inherently":[69],"inefficient":[70],"comparison":[72],"adaptive":[74],"embeddings,":[75],"but":[76],"it":[77],"remains":[78],"an":[79,121],"unresolved":[80],"algorithmic":[81],"challenge":[82],"design":[84,129],"efficient":[85],"algorithms":[87,108,130,184],"that":[88,95,153,167],"demand":[92],"on-the-fly,":[93],"i.e.,":[94],"online.":[97],"In":[98],"this":[99],"paper,":[100],"we":[101,188],"derive":[102],"optimal":[103],"deterministic":[104,149,155,180],"randomized":[106,165,183],"online":[107,111],"for":[109,131,195],"star":[116],"graphs.":[118],"This":[119],"essential":[122],"building":[123],"block":[124],"on":[125],"way":[127],"more":[132],"complex":[133],"graphs,":[135],"representing":[136],"single":[138],"node":[139],"its":[141],"neighborhood.":[142],"We":[143],"start":[144],"by":[145,190],"presenting":[146],"$1.5$-competitive":[148],"algorithm":[150,156,166],"showing":[152],"no":[154],"perform":[158],"better.":[159],"Our":[160],"main":[161],"contribution":[162],"achieves":[168],"significantly":[170],"better":[171],"competitive":[172],"ratio":[173],"$11/9":[175],"\\approx":[176],"1.222$.":[177],"Both":[178],"optimal,":[186],"which":[187],"prove":[189],"deriving":[191],"tight":[192],"lower":[193],"bounds":[194],"competitiveness":[197],"any":[199],"algorithm.":[200]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2026-05-20T00:00:00"}