{"id":"https://openalex.org/W4414699962","doi":"https://doi.org/10.48550/arxiv.2509.15687","title":"Efficient Heuristic Algorithms for Interleaving Distance between Merge Trees","display_name":"Efficient Heuristic Algorithms for Interleaving Distance between Merge Trees","publication_year":2025,"publication_date":"2025-09-19","ids":{"openalex":"https://openalex.org/W4414699962","doi":"https://doi.org/10.48550/arxiv.2509.15687"},"language":"en","primary_location":{"id":"pmh:oai:arXiv.org:2509.15687","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2509.15687","pdf_url":"https://arxiv.org/pdf/2509.15687","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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"type":"preprint","indexed_in":["arxiv","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2509.15687","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5039113116","display_name":"Elena Farahbakhsh Touli","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Touli, Elena Farahbakhsh","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5060181768","display_name":"Talha Bin Masood","orcid":"https://orcid.org/0000-0001-5352-1086"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Masood, Talha Bin","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"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/T10538","display_name":"Data Mining Algorithms and Applications","score":0.980400025844574,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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/T10538","display_name":"Data Mining Algorithms and Applications","score":0.980400025844574,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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/interleaving","display_name":"Interleaving","score":0.8644000291824341},{"id":"https://openalex.org/keywords/merge","display_name":"Merge (version control)","score":0.748199999332428},{"id":"https://openalex.org/keywords/merge-algorithm","display_name":"Merge algorithm","score":0.6191999912261963},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.545199990272522},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.5062999725341797},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.375}],"concepts":[{"id":"https://openalex.org/C28034677","wikidata":"https://www.wikidata.org/wiki/Q17092530","display_name":"Interleaving","level":2,"score":0.8644000291824341},{"id":"https://openalex.org/C197129107","wikidata":"https://www.wikidata.org/wiki/Q1921621","display_name":"Merge (version control)","level":2,"score":0.748199999332428},{"id":"https://openalex.org/C140086265","wikidata":"https://www.wikidata.org/wiki/Q11341754","display_name":"Merge algorithm","level":4,"score":0.6191999912261963},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6093999743461609},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5503000020980835},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.545199990272522},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.5062999725341797},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4634999930858612},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.375},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.3425999879837036},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.3075999915599823},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.30379998683929443},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.30169999599456787},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.26249998807907104},{"id":"https://openalex.org/C170858558","wikidata":"https://www.wikidata.org/wiki/Q1394144","display_name":"Automatic summarization","level":2,"score":0.2558000087738037},{"id":"https://openalex.org/C36464697","wikidata":"https://www.wikidata.org/wiki/Q451553","display_name":"Visualization","level":2,"score":0.2538999915122986}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:arXiv.org:2509.15687","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2509.15687","pdf_url":"https://arxiv.org/pdf/2509.15687","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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"doi:10.48550/arxiv.2509.15687","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2509.15687","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":"Preprint"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2509.15687","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2509.15687","pdf_url":"https://arxiv.org/pdf/2509.15687","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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Merge":[0],"trees":[1,40,50,53,78,95],"are":[2],"fundamental":[3],"structures":[4],"in":[5,22,117,130],"topological":[6],"data":[7],"analysis.":[8],"Interleaving":[9],"distance":[10,36,47,74],"is":[11],"a":[12,28,58,66,107,141],"widely":[13],"accepted":[14],"metric":[15],"for":[16,32,70,125,144,152],"comparing":[17,126],"merge":[18,39,77,127,145],"trees,":[19,128],"with":[20,41,54,79],"applications":[21],"visualization":[23],"and":[24,82,120,148],"scientific":[25],"computing.":[26],"While":[27],"greedy":[29],"algorithm":[30,69,109],"exists":[31],"finding":[33],"the":[34,45,72,91,94,160],"interleaving":[35,46,73],"between":[37,48,75],"labeled":[38,52,76],"overlapping":[42],"labels,":[43],"computing":[44],"unlabeled":[49,133],"or":[51,134],"disjoint":[55],"labels":[56,88],"remains":[57],"significant":[59],"challenge.":[60],"In":[61],"this":[62,157],"work,":[63],"we":[64],"introduce":[65,102],"novel":[67],"heuristic":[68],"approximating":[71],"partial":[80],"agreement":[81],"disagreement.":[83],"Our":[84],"method":[85],"strategically":[86],"assigns":[87],"primarily":[89],"to":[90,96],"leaves":[92],"of":[93,106,162],"infer":[97],"structural":[98],"correspondence.":[99],"We":[100,155],"also":[101],"an":[103],"enhanced":[104],"version":[105],"previous":[108],"that":[110],"offers":[111,149],"improved":[112],"performance.":[113],"Both":[114],"algorithms":[115],"run":[116],"polynomial":[118],"time":[119],"provide":[121],"practical,":[122],"efficient":[123],"alternatives":[124],"particularly":[129],"cases":[131],"involving":[132],"structurally":[135],"diverse":[136],"data.":[137],"This":[138],"work":[139],"contributes":[140],"new":[142],"direction":[143],"tree":[146],"analysis":[147],"promising":[150],"tools":[151],"real-world":[153],"applications.":[154],"demonstrate":[156],"application":[158],"on":[159],"simulation":[161],"time-varying":[163],"electron":[164],"density.":[165]},"counts_by_year":[],"updated_date":"2026-07-01T06:00:48.157686","created_date":"2025-10-10T00:00:00"}