{"id":"https://openalex.org/W6925964192","doi":"https://doi.org/10.20382/jocg.v13i1a4","title":"FPT-Algorithms for computing Gromov-Hausdorff and interleaving distances between trees","display_name":"FPT-Algorithms for computing Gromov-Hausdorff and interleaving distances between trees","publication_year":2022,"publication_date":"2022-04-20","ids":{"openalex":"https://openalex.org/W6925964192","doi":"https://doi.org/10.20382/jocg.v13i1a4"},"language":"en","primary_location":{"id":"pmh:oai:ojs.library.carleton.ca:article/3773","is_oa":false,"landing_page_url":"https://jocg.org/index.php/jocg/article/view/3773","pdf_url":null,"source":{"id":"https://openalex.org/S4306400962","display_name":"Journal of Computational Geometry (Carleton University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I67031392","host_organization_name":"Carleton University","host_organization_lineage":["https://openalex.org/I67031392"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Computational Geometry; Vol. 13 No. 1 (2022); 89\u2013124","raw_type":"info:eu-repo/semantics/article"},"type":"article","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.20382/jocg.v13i1a4","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Farahbakhsh Touli, Elena","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Farahbakhsh Touli, Elena","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":null,"display_name":"Wang, Yusu","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Wang, Yusu","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.4155,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.76040401,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":95,"max":96},"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/T11711","display_name":"COVID-19 Pandemic Impacts","score":0.36340001225471497,"subfield":{"id":"https://openalex.org/subfields/2002","display_name":"Economics and Econometrics"},"field":{"id":"https://openalex.org/fields/20","display_name":"Economics, Econometrics and Finance"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T11711","display_name":"COVID-19 Pandemic Impacts","score":0.36340001225471497,"subfield":{"id":"https://openalex.org/subfields/2002","display_name":"Economics and Econometrics"},"field":{"id":"https://openalex.org/fields/20","display_name":"Economics, Econometrics and Finance"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T14463","display_name":"Diverse Scientific Research Studies","score":0.04039999842643738,"subfield":{"id":"https://openalex.org/subfields/3600","display_name":"General Health Professions"},"field":{"id":"https://openalex.org/fields/36","display_name":"Health Professions"},"domain":{"id":"https://openalex.org/domains/4","display_name":"Health Sciences"}},{"id":"https://openalex.org/T12916","display_name":"COVID-19 impact on air quality","score":0.03269999846816063,"subfield":{"id":"https://openalex.org/subfields/2306","display_name":"Global and Planetary Change"},"field":{"id":"https://openalex.org/fields/23","display_name":"Environmental Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/metric-space","display_name":"Metric space","score":0.5458999872207642},{"id":"https://openalex.org/keywords/intrinsic-metric","display_name":"Intrinsic metric","score":0.49570000171661377},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.4772999882698059},{"id":"https://openalex.org/keywords/metric","display_name":"Metric (unit)","score":0.4542999863624573},{"id":"https://openalex.org/keywords/interleaving","display_name":"Interleaving","score":0.3822999894618988},{"id":"https://openalex.org/keywords/edit-distance","display_name":"Edit distance","score":0.36160001158714294},{"id":"https://openalex.org/keywords/shortest-path-tree","display_name":"Shortest-path tree","score":0.3580000102519989},{"id":"https://openalex.org/keywords/distance","display_name":"Distance","score":0.3549000024795532},{"id":"https://openalex.org/keywords/merge","display_name":"Merge (version control)","score":0.3522000014781952}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7062000036239624},{"id":"https://openalex.org/C198043062","wikidata":"https://www.wikidata.org/wiki/Q180953","display_name":"Metric space","level":2,"score":0.5458999872207642},{"id":"https://openalex.org/C41261874","wikidata":"https://www.wikidata.org/wiki/Q3855712","display_name":"Intrinsic metric","level":4,"score":0.49570000171661377},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.4772999882698059},{"id":"https://openalex.org/C176217482","wikidata":"https://www.wikidata.org/wiki/Q860554","display_name":"Metric (unit)","level":2,"score":0.4542999863624573},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4327999949455261},{"id":"https://openalex.org/C28034677","wikidata":"https://www.wikidata.org/wiki/Q17092530","display_name":"Interleaving","level":2,"score":0.3822999894618988},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3813000023365021},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.37560001015663147},{"id":"https://openalex.org/C44359876","wikidata":"https://www.wikidata.org/wiki/Q5338467","display_name":"Edit distance","level":2,"score":0.36160001158714294},{"id":"https://openalex.org/C23394520","wikidata":"https://www.wikidata.org/wiki/Q4919350","display_name":"Shortest-path tree","level":3,"score":0.3580000102519989},{"id":"https://openalex.org/C54385418","wikidata":"https://www.wikidata.org/wiki/Q2742711","display_name":"Distance","level":4,"score":0.3549000024795532},{"id":"https://openalex.org/C197129107","wikidata":"https://www.wikidata.org/wiki/Q1921621","display_name":"Merge (version control)","level":2,"score":0.3522000014781952},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.3488999903202057},{"id":"https://openalex.org/C141898687","wikidata":"https://www.wikidata.org/wiki/Q1501997","display_name":"Hausdorff distance","level":2,"score":0.33329999446868896},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.30230000615119934},{"id":"https://openalex.org/C196613150","wikidata":"https://www.wikidata.org/wiki/Q3966092","display_name":"Convex metric space","level":3,"score":0.29280000925064087},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.29159998893737793},{"id":"https://openalex.org/C42747912","wikidata":"https://www.wikidata.org/wiki/Q1048447","display_name":"Multiplicative function","level":2,"score":0.2912999987602234},{"id":"https://openalex.org/C191226916","wikidata":"https://www.wikidata.org/wiki/Q5384710","display_name":"Equivalence of metrics","level":4,"score":0.28209999203681946},{"id":"https://openalex.org/C182964748","wikidata":"https://www.wikidata.org/wiki/Q208216","display_name":"Triangle inequality","level":2,"score":0.2791000008583069},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.2720000147819519},{"id":"https://openalex.org/C177547787","wikidata":"https://www.wikidata.org/wiki/Q6034319","display_name":"Injective metric space","level":3,"score":0.2687999904155731},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.26019999384880066},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2597000002861023},{"id":"https://openalex.org/C127104897","wikidata":"https://www.wikidata.org/wiki/Q5454858","display_name":"Fisher information metric","level":4,"score":0.2531000077724457}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:ojs.library.carleton.ca:article/3773","is_oa":false,"landing_page_url":"https://jocg.org/index.php/jocg/article/view/3773","pdf_url":null,"source":{"id":"https://openalex.org/S4306400962","display_name":"Journal of Computational Geometry (Carleton University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I67031392","host_organization_name":"Carleton University","host_organization_lineage":["https://openalex.org/I67031392"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Computational Geometry; Vol. 13 No. 1 (2022); 89\u2013124","raw_type":"info:eu-repo/semantics/article"},{"id":"doi:10.20382/jocg.v13i1a4","is_oa":true,"landing_page_url":"https://doi.org/10.20382/jocg.v13i1a4","pdf_url":null,"source":{"id":"https://openalex.org/S4306400962","display_name":"Journal of Computational Geometry (Carleton University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I67031392","host_organization_name":"Carleton University","host_organization_lineage":["https://openalex.org/I67031392"],"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-journal"}],"best_oa_location":{"id":"doi:10.20382/jocg.v13i1a4","is_oa":true,"landing_page_url":"https://doi.org/10.20382/jocg.v13i1a4","pdf_url":null,"source":{"id":"https://openalex.org/S4306400962","display_name":"Journal of Computational Geometry (Carleton University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I67031392","host_organization_name":"Carleton University","host_organization_lineage":["https://openalex.org/I67031392"],"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-journal"},"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":{"The":[0,176],"Gromov-Hausdorff":[1,34,114,136,162,226,284],"distance":[2,35,115,137,163,170,218,242,269,285,297],"is":[3,45,78,86,109,155,191,236,301,307,311],"a":[4,42,46,59,72,119,128,144,159,184,192,244,261,317],"natural":[5],"way":[6,245],"to":[7,23,111,220,250,255,265,278,281,293,313],"measure":[8],"the":[9,33,54,76,84,87,93,113,150,168,172,195,216,225,230,240,267,283,295,323],"distortion":[10],"between":[11,36,116,138,270,286,298],"two":[12,37,139,271,287],"metric":[13,38,43,47,57,73,85,91,141,165,288],"spaces.":[14],"However,":[15],"there":[16],"has":[17,327],"been":[18],"only":[19],"limited":[20],"algorithmic":[21],"development":[22,151],"compute":[24,256,266,294],"or":[25,212],"approximate":[26,112,282,314],"this":[27,124],"distance.":[28,227],"We":[29,258],"focus":[30],"on":[31,58],"computing":[32],"trees.":[39,175,289],"Roughly":[40],"speaking,":[41],"tree":[44,63,74],"space":[48],"that":[49,100,133,209,237,246,309],"can":[50,68,134],"be":[51,69],"realized":[52],"by":[53,158],"shortest":[55,89],"path":[56,90],"tree.":[60,94],"Any":[61],"finite":[62],"with":[64,104,336],"positive":[65],"edge":[66,81,106,338],"weight":[67,77],"viewed":[70],"as":[71,80,183,305],"where":[75],"treated":[79],"length":[82],"and":[83,167,198,201,321],"induced":[88],"in":[92,180,243],"Previously,":[95],"Agarwal":[96],"et":[97],"al.":[98],"showed":[99],"even":[101,333],"for":[102,164,171,215,224,334],"trees":[103,142,166,178,273,300,335],"unit":[105,337],"length,":[107],"it":[108,248,306,310,315],"NP-hard":[110,312],"them":[117],"within":[118,143,316],"factor":[120,146,318,330],"of":[121,147,152,194,203,229,233,302,319,331],"$3$.":[122],"In":[123],"paper,":[125],"we":[126,238],"present":[127,260],"fixed-parameter":[129,262],"tractable":[130,263],"(FPT)":[131],"algorithm":[132,154,214,223,264,326],"approximatethe":[135],"general":[140],"multiplicative":[145],"$14$.":[148],"Interestingly,":[149],"our":[153,234],"made":[156],"possible":[157],"connection":[160],"betweenthe":[161],"interleaving":[169,217,241,268,296],"so-called":[173],"merge":[174,177,272,299],"arise":[179],"practice":[181],"naturally":[182],"simple":[185],"yet":[186],"meaningful":[187],"topological":[188],"summary":[189],"(it":[190],"variant":[193],"Reeb":[196],"graphs":[197],"contour":[199],"trees),":[200],"are":[202],"independent":[204],"interest.":[205],"It":[206],"turns":[207],"out":[208],"an":[210,221,279,328],"exact":[211,291],"approximation":[213,222,329],"leads":[219,277],"One":[228],"key":[231],"contributions":[232],"work":[235],"redefine":[239],"makes":[247],"easier":[249],"develop":[251],"dynamic":[252],"programming":[253],"approaches":[254],"it.":[257],"then":[259],"exactly,":[274],"which":[275],"ultimately":[276],"FPT-algorithm":[280,292],"This":[290],"interest":[303],"itself,":[304],"known":[308,325],"$3$,":[320],"previously":[322],"best":[324],"$O(\\sqrt{n})$":[332],"length.":[339]},"counts_by_year":[{"year":2025,"cited_by_count":2}],"updated_date":"2025-11-06T06:51:31.235846","created_date":"2025-10-10T00:00:00"}