{"id":"https://openalex.org/W3211137636","doi":"https://doi.org/10.17169/refubium-31827","title":"Geometric Graphs: Reachability, Long Trees and Short Cycles","display_name":"Geometric Graphs: Reachability, Long Trees and Short Cycles","publication_year":2021,"publication_date":"2021-01-01","ids":{"openalex":"https://openalex.org/W3211137636","doi":"https://doi.org/10.17169/refubium-31827","mag":"3211137636"},"language":"en","primary_location":{"id":"pmh:oai:aleph.bib-bvb.de:BVB01-032938612","is_oa":false,"landing_page_url":"https://refubium.fu-berlin.de/handle/fub188/32099","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"software, multimedia"},"type":"dissertation","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.17169/refubium-31827","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5057812367","display_name":"Katharina Klost","orcid":"https://orcid.org/0000-0002-9884-3297"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Klost, Katharina Alexandra","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5057812367"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.3002102,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9952999949455261,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9952999949455261,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/T11106","display_name":"Data Management and Algorithms","score":0.9894999861717224,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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.984499990940094,"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/reachability","display_name":"Reachability","score":0.8840103149414062},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4750261902809143},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4258945882320404},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.33763250708580017}],"concepts":[{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.8840103149414062},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4750261902809143},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4258945882320404},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.33763250708580017}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:aleph.bib-bvb.de:BVB01-032938612","is_oa":false,"landing_page_url":"https://refubium.fu-berlin.de/handle/fub188/32099","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"software, multimedia"},{"id":"doi:10.17169/refubium-31827","is_oa":true,"landing_page_url":"https://doi.org/10.17169/refubium-31827","pdf_url":null,"source":{"id":"https://openalex.org/S7407052913","display_name":"Universit\u00e4tsbibliothek der FU Berlin Hochschulschriftenstelle u. Dokumentenserver","issn_l":null,"issn":[],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"thesis"}],"best_oa_location":{"id":"doi:10.17169/refubium-31827","is_oa":true,"landing_page_url":"https://doi.org/10.17169/refubium-31827","pdf_url":null,"source":{"id":"https://openalex.org/S7407052913","display_name":"Universit\u00e4tsbibliothek der FU Berlin Hochschulschriftenstelle u. Dokumentenserver","issn_l":null,"issn":[],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"thesis"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/13","score":0.5899999737739563,"display_name":"Climate action"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2396482382","https://openalex.org/W364922967","https://openalex.org/W2598856090","https://openalex.org/W2972219094","https://openalex.org/W2783874386","https://openalex.org/W94490440","https://openalex.org/W2481604757","https://openalex.org/W1537543462","https://openalex.org/W896190271","https://openalex.org/W1974685141","https://openalex.org/W1982680224","https://openalex.org/W1479863711","https://openalex.org/W2292469456","https://openalex.org/W112858196","https://openalex.org/W3101771517","https://openalex.org/W2900807648","https://openalex.org/W618700163","https://openalex.org/W2516753606","https://openalex.org/W2735487701","https://openalex.org/W2125734716"],"abstract_inverted_index":{"Given":[0],"a":[1,8,12,118,157,189,196,199,203,207,247,307,310,316,334,354,399,421,437,476,495,547,603,608,637],"set":[2,19,538],"S":[3,15,89,553],"of":[4,44,55,73,78,106,142,178,192,228,333,382,393,405,475,479,552,566,590,598,629,643,655,671,684],"n":[5,448,456,506],"point":[6,80],"sites,":[7,406],"geometric":[9,42,107],"graph":[10,13,86,159,198,276,309,336,356,401],"is":[11,62,215,268,472,574,585,624],"with":[14,117,164,350,463,516,612],"as":[16,24,129,135,188,279],"its":[17],"vertex":[18],"whose":[20],"edges":[21,31,352],"are":[22,33,75,152,162,180,381],"drawn":[23],"line":[25],"segments":[26],"connecting":[27,58],"the":[28,45,53,56,63,79,96,102,123,133,136,218,265,284,330,341,368,391,403,415,424,473,489,517,536,556,581,588,596,625,641,644],"sites.":[29,149],"The":[30,150,175,583],"that":[32,91,305,348,380,397,440,498,554],"present":[34],"between":[35,66],"these":[36,147,231],"sites":[37,93,124,161],"can":[38,125,185,312,320,337,357],"be":[39,127,186,313,321,338,358,541],"defined":[40,87,144,220],"by":[41,131,221],"properties":[43],"site":[46,116,134,200,208,419,537],"set.":[47,81],"When":[48],"talking":[49],"about":[50],"weighted":[51,331],"edges,":[52],"weight":[54],"edge":[57,166,205,558,627],"s":[59,67,201],"and":[60,68,168,211,250,297,315,617,676],"t":[61,214],"Euclidean":[64],"distance":[65],"t.":[69],"One":[70],"such":[71,90,278,318],"class":[72,105],"graphs":[74,108,145,154,179,182,281,296,486],"spanning":[76,533,549,633],"trees":[77,534,654,670,683],"That":[82],"is,":[83],"an":[84,165,630,660,666],"acyclic":[85],"on":[88,146,230,370,535],"all":[92],"lie":[94],"in":[95,110,217,283,306,323,353,360,423,444,502],"same":[97,342,518],"connected":[98,163],"component.":[99],"To":[100,540],"define":[101],"second":[103,176],"broad":[104],"considered":[109],"this":[111,121,287,433,572,679],"thesis,":[112,288],"we":[113,289,303,373,413,435,483,493,543,647],"extend":[114,678],"each":[115,418],"radius.":[119],"In":[120,156,195,257,286,432],"setting":[122],"also":[126,346,531,595],"interpreted":[128],"disks,":[130],"using":[132],"center.":[137],"We":[138,223,242,345,389,530,576,601,658],"consider":[139,224,390,414,484,532,648],"two":[140,160,564,578],"kinds":[141],"geometrically":[143],"extended":[148],"first":[151,584],"disk":[153,158,193,219,295,335,400,485],"D(S).":[155],"if":[167,170,210,213,571],"only":[169,212],"their":[171],"corresponding":[172],"disks":[173],"intersect.":[174],"type":[177],"transmission":[181,197,299,308,355,371],"T(S).":[183],"These":[184],"seen":[187],"directed":[190,204],"version":[191],"graphs.":[194,300],"has":[202,420],"to":[206,545,580,586,606,681],"t,":[209],"contained":[216],"s.":[222],"three":[225,675],"main":[226],"types":[227],"problems":[229],"graphs:":[232],"TRIANGLES":[233],"AND":[234,239],"GIRTH":[235],"IN":[236],"DISK":[237,386],"GRAPHS":[238,241],"TRANSMISSION":[240],"give":[243,436,659],"algorithms":[244,263,273,592,652],"for":[245,253,274,294,298,427,525,653,664,669],"finding":[246,254,260,665],"(shortest)":[248],"triangle":[249,311,319],"more":[251,562],"generally":[252],"short":[255],"cycles.":[256],"general":[258],"graphs,":[259,372],"substantially":[261],"faster":[262],"than":[264,563],"naive":[266],"approach":[267],"notoriously":[269],"hard.":[270],"However,":[271],"better":[272],"special":[275,682],"classes":[277],"planar":[280],"exist":[282],"literature.":[285],"obtain":[290,494],"similarly":[291],"efficient":[292],"results":[293,369],"More":[301],"precisely,":[302],"show":[304,347],"detected":[314],"shortest":[317],"found":[322,339],"O(n":[324,361],"log":[325,362,466,521],"n)":[326,452,454,459,511],"expected":[327,365,461,514],"time.":[328,366],"Furthermore,":[329],"girth":[332],"within":[340],"time":[343,523,651,662],"bound.":[344],"cycle":[349],"k":[351],"identified":[359],"n)+":[363],"n2^{O(k)}":[364],"For":[367],"develop":[374],"batched":[375],"range":[376,425],"query":[377,468],"data":[378,395,438,496],"structures":[379,396],"independent":[383],"interest.":[384],"DYNAMIC":[385],"GRAPH":[387],"CONNECTIVITY":[388],"problem":[392,573],"designing":[394],"maintain":[398],"under":[402],"deletion":[404],"while":[407],"allowing":[408],"interleaved":[409],"connectivity":[410],"queries.":[411,526],"First":[412],"setting,":[416],"where":[417,470,622],"radius":[422],"[1,\u03a8]":[426],"some":[428],"fixed":[429],"value":[430],"\u03a8.":[431],"scenario,":[434],"structure":[439,497],"supports":[441,499],"m":[442,450,500,508],"deletions":[443,501],"O(":[445,503],"(n":[446,504],"log^5":[447],"+":[449,455,507],"log^9":[451],"\u03bb_6(log":[453],"log\u03a8":[457],"log^4":[458],"overall":[460,513],"time,":[462,469,515],"O((log":[464,519],"n)/(log":[465,520],"n))":[467,522],"\u03bb_6(n)":[471],"length":[474,559,628],"Davenport-Schinzel":[477],"sequence":[478],"order":[480],"6.":[481],"If":[482],"without":[487],"bounding":[488],"maximal":[490],"allowed":[491],"radius,":[492],"log^6":[505],"log^{10}n)":[509],"\u03bb_6(\\log":[510],")":[512],"bound":[524],"LONG":[527],"PLANE":[528],"TREES":[529],"S.":[539],"precise,":[542],"aim":[544],"find":[546],"plane":[548,609,632],"tree":[550,610],"Topt":[551],"maximizes":[555],"total":[557,626],"|Topt|.":[560],"Despite":[561],"decades":[565],"research,":[567],"it":[568],"remains":[569],"open":[570],"NP-hard.":[575],"take":[577],"approaches":[579],"problem.":[582],"follow":[587],"venue":[589],"approximation":[591],"which":[593],"was":[594],"focus":[597],"previous":[599],"research.":[600],"describe":[602],"polynomial-time":[604],"algorithm":[605,663,680],"construct":[607],"Talg":[611],"diameter":[613,672,685],"at":[614,673,686],"most":[615,674,687],"four":[616],"|Talg|":[618],">=":[619],"0.546":[620],"|Topt|,":[621],"|Topt|":[623],"optimal":[631],"tree.":[634],"This":[635],"constitutes":[636],"significant":[638],"improvement":[639],"over":[640],"state":[642],"art.":[645],"Second,":[646],"exact":[649,667],"polynomial":[650],"bounded":[656],"diameter.":[657],"O(n^4)":[661],"solution":[668],"then":[677],"four.":[688]},"counts_by_year":[],"updated_date":"2025-11-06T06:51:31.235846","created_date":"2025-10-10T00:00:00"}