{"id":"https://openalex.org/W6964016289","doi":"https://doi.org/10.25434/capresi-chiara_phd2022","title":"Algorithms for identifying clusters in temporal graphs and realising distance matrices by unicyclic graphs.","display_name":"Algorithms for identifying clusters in temporal graphs and realising distance matrices by unicyclic graphs.","publication_year":2022,"publication_date":"2022-01-01","ids":{"openalex":"https://openalex.org/W6964016289","doi":"https://doi.org/10.25434/capresi-chiara_phd2022"},"language":"en","primary_location":{"id":"pmh:oai:usiena-air.unisi.it:11365/1211314","is_oa":true,"landing_page_url":"http://hdl.handle.net/11365/1211314","pdf_url":null,"source":{"id":"https://openalex.org/S4377196319","display_name":"Use Siena air (University of Siena)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I102064193","host_organization_name":"University of Siena","host_organization_lineage":["https://openalex.org/I102064193"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/doctoralThesis"},"type":"other","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"http://hdl.handle.net/11365/1211314","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Capresi, Chiara","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Capresi, Chiara","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":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":true,"primary_topic":null,"topics":[],"keywords":[{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.6011000275611877},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.48559999465942383},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.48339998722076416},{"id":"https://openalex.org/keywords/cluster","display_name":"Cluster (spacecraft)","score":0.47690001130104065},{"id":"https://openalex.org/keywords/cluster-analysis","display_name":"Cluster analysis","score":0.3163999915122986},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.2872999906539917}],"concepts":[{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.6011000275611877},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.48559999465942383},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.48339998722076416},{"id":"https://openalex.org/C164866538","wikidata":"https://www.wikidata.org/wiki/Q367351","display_name":"Cluster (spacecraft)","level":2,"score":0.47690001130104065},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4456999897956848},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4456999897956848},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.44179999828338623},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.39169999957084656},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.37049999833106995},{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.3163999915122986},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.30649998784065247},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.2872999906539917},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.2854999899864197},{"id":"https://openalex.org/C64339825","wikidata":"https://www.wikidata.org/wiki/Q722659","display_name":"Graph property","level":5,"score":0.28220000863075256},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.26499998569488525}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:usiena-air.unisi.it:11365/1211314","is_oa":true,"landing_page_url":"http://hdl.handle.net/11365/1211314","pdf_url":null,"source":{"id":"https://openalex.org/S4377196319","display_name":"Use Siena air (University of Siena)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I102064193","host_organization_name":"University of Siena","host_organization_lineage":["https://openalex.org/I102064193"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/doctoralThesis"},{"id":"doi:10.25434/capresi-chiara_phd2022","is_oa":true,"landing_page_url":"https://doi.org/10.25434/capresi-chiara_phd2022","pdf_url":null,"source":{"id":"https://openalex.org/S7407051005","display_name":"Universit\u00e0 degli Studi di Siena","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":"article"}],"best_oa_location":{"id":"pmh:oai:usiena-air.unisi.it:11365/1211314","is_oa":true,"landing_page_url":"http://hdl.handle.net/11365/1211314","pdf_url":null,"source":{"id":"https://openalex.org/S4377196319","display_name":"Use Siena air (University of Siena)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I102064193","host_organization_name":"University of Siena","host_organization_lineage":["https://openalex.org/I102064193"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/doctoralThesis"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"In":[0,29,52,263,319],"this":[1,53,79,213,268,356],"thesis":[2],"I":[3,17],"present":[4],"some":[5],"results,":[6],"which":[7,16,47],"mainly":[8],"concern":[9],"finding":[10],"algorithms":[11],"for":[12,138,180,219],"graphs":[13,100],"problems,":[14],"to":[15,95,294],"worked":[18],"on":[19,277],"during":[20],"my":[21,27],"Ph.D":[22],"with":[23,101],"the":[24,43,61,65,92,96,125,132,141,151,224,229,235,264,278,328,344],"supervision":[25],"of":[26,42,68,72,98,135,140,143,202,226,232,234,258,267,280,321,327,353],"supervisors.":[28],"particular,":[30],"as":[31,104,350],"a":[32,38,102,112,129,156,160,177,188,192,208,244,247,275,297,308,316,324,347,351],"first":[33,56,271],"theme,":[34],"it":[35,57,81,109,167,174,240,272,287,339],"is":[36,58,74,82,86,110,118,128,146,159,175,191,241,273,288,340,358],"presented":[37,111,176],"new":[39],"temporal":[40,66,99,182,189,194,210,237,249],"interpretation":[41],"well":[44],"studied":[45],"\\ClusterEditing":[46,73],"we":[48,90,215],"called":[49],"\\EditTempClique":[50],"(\\ETC).":[51],"regard,":[54],"%at":[55],"shown":[59,242,341],"that":[60,84,114,116,144,155,187,246,292,331,342],"corresponding":[62],"versions":[63],"in":[64,78,121,149],"setting":[67],"any":[69,171],"\\NP-Hard":[70],"version":[71],"still":[75],"\\NP-Hard.":[76],"Then,":[77],"work,":[80],"proved":[83],"\\ETC":[85,117,220],"\\NP-Complete":[87],"even":[88],"if":[89,124,163,166,196,199,296,343],"restrict":[91],"possible":[93],"inputs":[94],"class":[97],"path":[103,130,145],"their":[105],"underlying":[106,126],"graph.":[107,211,238,332],"Furthermore,":[108,239,338],"result":[113,276],"shows":[115],"instead":[119],"tractable":[120],"polynomial":[122],"time":[123],"graph":[127,158,162,190,195,250,311,349],"and":[131,164,197,228,285],"maximum":[133],"number":[134,225],"appearances":[136],"allowed":[137],"each":[139],"edges":[142],"fixed.":[147],"Taking":[148],"mind":[150],"known":[152],"key":[153],"observation":[154],"static":[157],"cluster":[161,181,193,209,248],"only":[165,198],"does":[168],"not":[169,252],"contain":[170],"induced":[172],"$P_3$,":[173],"local":[178],"characterisation":[179,185],"graphs.":[183],"This":[184],"establishes":[186],"every":[200],"subset":[201],"at":[203,259,270,313],"most":[204,260],"five":[205],"vertices":[206],"induces":[207],"Using":[212],"characterisation,":[214],"obtain":[216],"an":[217,290],"\\FPT~algorithm":[218],"parameterised":[221],"simultaneously":[222],"by":[223,256,283,307,315],"modifications":[227],"lifetime":[230],"(number":[231],"timesteps)":[233],"input":[236],"via":[243],"counterexample,":[245],"can":[251,302],"be":[253,305],"properly":[254],"characterised":[255],"sets":[257],"four":[261],"vertices.":[262],"last":[265],"Chapter":[266],"thesis,":[269],"proven":[274],"realisation":[279,352,357],"distance":[281,299],"matrices":[282],"$n-$cycles":[284],"then":[286,355],"developed":[289],"algorithm":[291,329,334,345],"allows":[293],"establish":[295],"given":[298],"matrix":[300],"$D$":[301],"or":[303,312],"cannot":[304],"realised":[306],"weighted":[309,317],"unicyclic":[310,348],"least":[314],"tree.":[318],"case":[320],"affirmative":[322],"answer,":[323],"second":[325],"part":[326],"reconstructs":[330],"The":[333],"takes":[335],"$\\mathcal":[336],"O(n^4)$.":[337],"returns":[346],"$D$,":[354],"optimal.":[359]},"counts_by_year":[],"updated_date":"2026-02-09T09:26:11.010843","created_date":"2025-10-10T00:00:00"}