{"id":"https://openalex.org/W6950449118","doi":"https://doi.org/10.5445/ir/1000161317","title":"Enabling Scalability: Graph Hierarchies and Fault Tolerance","display_name":"Enabling Scalability: Graph Hierarchies and Fault Tolerance","publication_year":2023,"publication_date":"2023-01-01","ids":{"openalex":"https://openalex.org/W6950449118","doi":"https://doi.org/10.5445/ir/1000161317"},"language":"en","primary_location":{"id":"pmh:oai:EVASTAR-Karlsruhe.de:1000161317","is_oa":true,"landing_page_url":"https://publikationen.bibliothek.kit.edu/1000161317","pdf_url":"https://publikationen.bibliothek.kit.edu/1000161317/151159167","source":{"id":"https://openalex.org/S4306401992","display_name":"Repository KITopen (Karlsruhe Institute of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I102335020","host_organization_name":"Karlsruhe Institute of Technology","host_organization_lineage":["https://openalex.org/I102335020"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"doc-type:doctoralThesis"},"type":"article","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://publikationen.bibliothek.kit.edu/1000161317/151159167","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Hespe, Lars Demian","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Hespe, Lars Demian","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"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.29895466,"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":true,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.21320000290870667,"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"}},"topics":[{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.21320000290870667,"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"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.15440000593662262,"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/T10772","display_name":"Distributed systems and fault tolerance","score":0.11309999972581863,"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/scalability","display_name":"Scalability","score":0.7214000225067139},{"id":"https://openalex.org/keywords/preprocessor","display_name":"Preprocessor","score":0.5652999877929688},{"id":"https://openalex.org/keywords/hierarchy","display_name":"Hierarchy","score":0.5414000153541565},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.510200023651123},{"id":"https://openalex.org/keywords/exploit","display_name":"Exploit","score":0.5047000050544739},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.4284000098705292},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.41260001063346863},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.41130000352859497},{"id":"https://openalex.org/keywords/directed-graph","display_name":"Directed graph","score":0.3833000063896179},{"id":"https://openalex.org/keywords/fault-tolerance","display_name":"Fault tolerance","score":0.35589998960494995}],"concepts":[{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.7214000225067139},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6288999915122986},{"id":"https://openalex.org/C34736171","wikidata":"https://www.wikidata.org/wiki/Q918333","display_name":"Preprocessor","level":2,"score":0.5652999877929688},{"id":"https://openalex.org/C31170391","wikidata":"https://www.wikidata.org/wiki/Q188619","display_name":"Hierarchy","level":2,"score":0.5414000153541565},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.510200023651123},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.508899986743927},{"id":"https://openalex.org/C165696696","wikidata":"https://www.wikidata.org/wiki/Q11287","display_name":"Exploit","level":2,"score":0.5047000050544739},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4593999981880188},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.4284000098705292},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.41260001063346863},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.41130000352859497},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.3833000063896179},{"id":"https://openalex.org/C63540848","wikidata":"https://www.wikidata.org/wiki/Q3140932","display_name":"Fault tolerance","level":2,"score":0.35589998960494995},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.3483999967575073},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.34119999408721924},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.3407000005245209},{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.33090001344680786},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.329800009727478},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.32190001010894775},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.3093999922275543},{"id":"https://openalex.org/C558772884","wikidata":"https://www.wikidata.org/wiki/Q1508564","display_name":"Graph rewriting","level":3,"score":0.30079999566078186},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.27649998664855957},{"id":"https://openalex.org/C70518039","wikidata":"https://www.wikidata.org/wiki/Q16000077","display_name":"Dimensionality reduction","level":2,"score":0.271699994802475},{"id":"https://openalex.org/C122818955","wikidata":"https://www.wikidata.org/wiki/Q1060343","display_name":"Independent set","level":3,"score":0.26489999890327454},{"id":"https://openalex.org/C192209626","wikidata":"https://www.wikidata.org/wiki/Q190909","display_name":"Focus (optics)","level":2,"score":0.2581000030040741},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.25769999623298645},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2526000142097473},{"id":"https://openalex.org/C97042676","wikidata":"https://www.wikidata.org/wiki/Q5597097","display_name":"Graph reduction","level":3,"score":0.243599995970726},{"id":"https://openalex.org/C187407849","wikidata":"https://www.wikidata.org/wiki/Q6889712","display_name":"Modular decomposition","level":5,"score":0.2433999925851822},{"id":"https://openalex.org/C2776013622","wikidata":"https://www.wikidata.org/wiki/Q2103021","display_name":"Polynomial hierarchy","level":3,"score":0.24310000240802765},{"id":"https://openalex.org/C106937863","wikidata":"https://www.wikidata.org/wiki/Q7236518","display_name":"Power graph analysis","level":3,"score":0.22949999570846558},{"id":"https://openalex.org/C2776401178","wikidata":"https://www.wikidata.org/wiki/Q12050496","display_name":"Feature (linguistics)","level":2,"score":0.21410000324249268},{"id":"https://openalex.org/C2777168461","wikidata":"https://www.wikidata.org/wiki/Q42196253","display_name":"Set operations","level":3,"score":0.21130000054836273},{"id":"https://openalex.org/C16311509","wikidata":"https://www.wikidata.org/wiki/Q4148050","display_name":"Dependency graph","level":3,"score":0.20730000734329224},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.2061000019311905},{"id":"https://openalex.org/C73301696","wikidata":"https://www.wikidata.org/wiki/Q5469984","display_name":"Formalism (music)","level":3,"score":0.20600000023841858},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.2045000046491623},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2045000046491623},{"id":"https://openalex.org/C64339825","wikidata":"https://www.wikidata.org/wiki/Q722659","display_name":"Graph property","level":5,"score":0.2029000073671341},{"id":"https://openalex.org/C112953755","wikidata":"https://www.wikidata.org/wiki/Q739462","display_name":"Graph drawing","level":3,"score":0.20200000703334808}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:EVASTAR-Karlsruhe.de:1000161317","is_oa":true,"landing_page_url":"https://publikationen.bibliothek.kit.edu/1000161317","pdf_url":"https://publikationen.bibliothek.kit.edu/1000161317/151159167","source":{"id":"https://openalex.org/S4306401992","display_name":"Repository KITopen (Karlsruhe Institute of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I102335020","host_organization_name":"Karlsruhe Institute of Technology","host_organization_lineage":["https://openalex.org/I102335020"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"doc-type:doctoralThesis"},{"id":"doi:10.5445/ir/1000161317","is_oa":true,"landing_page_url":"https://doi.org/10.5445/ir/1000161317","pdf_url":null,"source":{"id":"https://openalex.org/S7407052948","display_name":"KITopen","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":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article-journal"}],"best_oa_location":{"id":"pmh:oai:EVASTAR-Karlsruhe.de:1000161317","is_oa":true,"landing_page_url":"https://publikationen.bibliothek.kit.edu/1000161317","pdf_url":"https://publikationen.bibliothek.kit.edu/1000161317/151159167","source":{"id":"https://openalex.org/S4306401992","display_name":"Repository KITopen (Karlsruhe Institute of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I102335020","host_organization_name":"Karlsruhe Institute of Technology","host_organization_lineage":["https://openalex.org/I102335020"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"doc-type:doctoralThesis"},"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320331625","display_name":"Gauss Centre for Supercomputing","ror":"https://ror.org/0585fsj26"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W6950449118.pdf","grobid_xml":"https://content.openalex.org/works/W6950449118.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"In":[0,65,182,285],"this":[1,290],"dissertation,":[2,71,291],"we":[3,14,46,72,245,268,277,292,324,475,493,518],"explore":[4],"approaches":[5,97,458],"to":[6,23,60,81,84,98,173,184,207,314,330,344,455,470,490],"two":[7,96,340],"techniques":[8,59,341,352,430,478,487],"for":[9,30,90,107,153,178,222,238,256,342,375,396,415,461,497,521],"building":[10],"scalable":[11,31,481],"algorithms.":[12,33,482],"First,":[13],"look":[15,302],"at":[16,303],"different":[17,477,516],"graph":[18,32,92,299,491,522],"problems.":[19,44],"We":[20,87,218,338,381],"show":[21,508],"how":[22,74],"exploit":[24],"the":[25,48,66,70,128,154,159,179,223,273,286,315,397],"input":[26,129],"graph's":[27],"inherent":[28],"hierarchy":[29,210,248],"The":[34,101,233,369,407],"second":[35,234,287,408],"technique":[36,371,409],"takes":[37],"a":[38,185,209,247,294,362,411,419,442,504],"step":[39,206,295],"back":[40,296],"from":[41,63,272,297,346],"concrete":[42,298],"algorithmic":[43],"Here,":[45,312],"consider":[47],"case":[49],"of":[50,69,127,151,211,214,249,289,321,358,485],"node":[51],"failures":[52,329,347],"in":[53,76,120,134,195,241,307,334,432,437,453,503,514],"large":[54,85],"distributed":[55,378,505],"systems":[56,464],"and":[57,230,275,301,319,327,348,361,391,501,524],"present":[58,339,476,495],"quickly":[61],"recover":[62,345],"these.":[64],"first":[67,102,370],"part":[68,288],"investigate":[73],"hierarchies":[75],"graphs":[77],"can":[78,117,131,142,170,191,278,372,511],"be":[79,118,132,143,171,193,373,512],"used":[80,194,237,374],"scale":[82],"algorithms":[83,89,197,221,500],"inputs.":[86],"develop":[88,219],"three":[91],"problems":[93,109,226,300,306,523],"based":[94,252,354],"on":[95,253,355,388,404,463],"build":[99,208,246],"hierarchies.":[100],"approach":[103,235],"reduces":[104],"instance":[105,161],"sizes":[106],"NP-hard":[108,225],"by":[110],"applying":[111],"so-called":[112],"reduction":[113,189],"rules.":[114],"These":[115],"rules":[116,190],"applied":[119,202],"polynomial":[121,135],"time.":[122],"They":[123],"either":[124],"find":[125],"parts":[126],"that":[130,141,365,384,400,423,434,465,479,509],"solved":[133],"time,":[136],"or":[137],"they":[138,199,435],"identify":[139,382],"structures":[140,148,169],"contracted":[144,168],"(reduced)":[145],"into":[146],"smaller":[147],"without":[149],"loss":[150],"information":[152,360],"specific":[155,489],"problem.":[156],"After":[157],"solving":[158],"reduced":[160],"using":[162,418],"an":[163,175],"exponential-time":[164],"algorithm,":[165],"these":[166,486],"previously":[167],"uncontracted":[172],"obtain":[174],"exact":[176],"solution":[177],"original":[180],"input.":[181],"addition":[183],"simple":[186],"preprocessing":[187],"procedure,":[188],"also":[192,494],"branch-and-reduce":[196],"where":[198,244,439],"are":[200,269,353,488],"successively":[201],"after":[203,441],"each":[204],"branching":[205],"problem":[212],"kernels":[213],"increasing":[215,317],"computational":[216],"hardness.":[217],"reduction-based":[220],"classical":[224],"Maximum":[227,231],"Independent":[228],"Set":[229],"Cut.":[232],"is":[236,385,401,410,444,452],"route":[239],"planning":[240],"road":[242,250,265],"networks":[243],"segments":[251,266],"their":[254],"importance":[255],"long":[257],"distance":[258],"shortest":[259,282],"paths.":[260],"By":[261],"only":[262,392,402],"considering":[263],"important":[264],"when":[267],"far":[270],"away":[271],"source":[274],"destination,":[276],"substantially":[279],"speed":[280],"up":[281],"path":[283],"queries.":[284],"take":[293],"more":[304,332],"general":[305,376],"high":[308],"performance":[309],"computing":[310],"(HPC).":[311],"due":[313],"ever":[316],"size":[318],"complexity":[320],"HPC":[322],"clusters,":[323],"expect":[325],"hardware":[326],"software":[328],"become":[331],"common":[333,433],"massively":[335],"parallel":[336],"computations.":[337],"applications":[343,502,526],"resume":[349],"computation.":[350],"Both":[351,428],"in-memory":[356],"storage":[357],"redundant":[359],"data":[363,383,399,420],"distribution":[364,421],"enables":[366],"fast":[367,416],"recovery.":[368],"purpose":[377],"processing":[379],"frameworks:":[380],"redundantly":[386],"available":[387,403,469],"multiple":[389],"machines":[390,448],"introduce":[393],"additional":[394],"work":[395,436],"remaining":[398],"one":[405],"machine.":[406],"checkpointing":[412],"library":[413],"engineered":[414],"recovery":[417],"method":[422],"achieves":[424],"balanced":[425],"communication":[426],"loads.":[427],"our":[429],"have":[431],"settings":[438],"computation":[440],"failure":[443],"continued":[445],"with":[446],"less":[447],"than":[449],"before.":[450],"This":[451],"contrast":[454],"many":[456,515],"previous":[457],"that---in":[459],"particular":[460],"checkpointing---focus":[462],"keep":[466],"spare":[467],"resources":[468],"replace":[471],"failed":[472],"machines.":[473],"Overall,":[474],"enable":[480],"While":[483],"some":[484],"problems,":[492],"tools":[496],"fault":[498],"tolerant":[499],"setting.":[506],"To":[507],"those":[510],"helpful":[513],"domains,":[517],"evaluate":[519],"them":[520],"other":[525],"like":[527],"phylogenetic":[528],"tree":[529],"inference.":[530]},"counts_by_year":[],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2025-10-10T00:00:00"}