{"id":"https://openalex.org/W2462688741","doi":"https://doi.org/10.1137/1.9781611973105","title":"Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms","display_name":"Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms","publication_year":2013,"publication_date":"2013-01-06","ids":{"openalex":"https://openalex.org/W2462688741","doi":"https://doi.org/10.1137/1.9781611973105","mag":"2462688741"},"language":"en","primary_location":{"id":"doi:10.1137/1.9781611973105","is_oa":false,"landing_page_url":"http://doi.org/10.1137/1.9781611973105","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":null,"raw_type":"proceedings"},"type":"paratext","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5144939552","display_name":"G. S. Brodal","orcid":null},"institutions":[{"id":"https://openalex.org/I204337017","display_name":"Aarhus University","ror":"https://ror.org/01aj84f44","country_code":"DK","type":"education","lineage":["https://openalex.org/I204337017"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Brodal, G. S.","raw_affiliation_strings":["Aarhus University, Natural Sciences, Department of Computer Science, DK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Aarhus University, Natural Sciences, Department of Computer Science, DK","institution_ids":["https://openalex.org/I204337017"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5144682065","display_name":"R. Fagerberg","orcid":null},"institutions":[{"id":"https://openalex.org/I4210116091","display_name":"Department of Physics, Mathematics and Informatics","ror":"https://ror.org/023sm4k53","country_code":"BY","type":"facility","lineage":["https://openalex.org/I151823869","https://openalex.org/I4210116091"]}],"countries":["BY"],"is_corresponding":false,"raw_author_name":"Fagerberg, R.","raw_affiliation_strings":["SDU, Faculty of Science, Department of Mathematics and Computer Science, DK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"SDU, Faculty of Science, Department of Mathematics and Computer Science, DK","institution_ids":["https://openalex.org/I4210116091"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5145459528","display_name":"T. Mailund","orcid":null},"institutions":[{"id":"https://openalex.org/I204337017","display_name":"Aarhus University","ror":"https://ror.org/01aj84f44","country_code":"DK","type":"education","lineage":["https://openalex.org/I204337017"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Mailund, T.","raw_affiliation_strings":["Aarhus University, Natural Sciences, Department of Computer Science, DK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Aarhus University, Natural Sciences, Department of Computer Science, DK","institution_ids":["https://openalex.org/I204337017"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5113716245","display_name":"Christian N. S. Pedersen","orcid":null},"institutions":[{"id":"https://openalex.org/I204337017","display_name":"Aarhus University","ror":"https://ror.org/01aj84f44","country_code":"DK","type":"education","lineage":["https://openalex.org/I204337017"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Pedersen, Christian N. S.","raw_affiliation_strings":["Aarhus University, Natural Sciences, Department of Computer Science, DK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Aarhus University, Natural Sciences, Department of Computer Science, DK","institution_ids":["https://openalex.org/I204337017"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5145135089","display_name":"A. Sand","orcid":null},"institutions":[{"id":"https://openalex.org/I204337017","display_name":"Aarhus University","ror":"https://ror.org/01aj84f44","country_code":"DK","type":"education","lineage":["https://openalex.org/I204337017"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Sand, A.","raw_affiliation_strings":["Aarhus University, Natural Sciences, Department of Computer Science, DK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Aarhus University, Natural Sciences, Department of Computer Science, DK","institution_ids":["https://openalex.org/I204337017"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":96,"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":true,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.6029000282287598,"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"}},"topics":[{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.6029000282287598,"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"}},{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.5812000036239624,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"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.5390999913215637,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.566949725151062},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.45683783292770386}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.566949725151062},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.45683783292770386}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1137/1.9781611973105","is_oa":false,"landing_page_url":"http://doi.org/10.1137/1.9781611973105","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":null,"raw_type":"proceedings"},{"id":"pmh:oai:sdu.dk:openaire_cris_publications/fd1a3c3f-d583-4c83-a3bb-f65e2b4bcd2e","is_oa":false,"landing_page_url":"https://portal.findresearcher.sdu.dk/da/publications/fd1a3c3f-d583-4c83-a3bb-f65e2b4bcd2e","pdf_url":null,"source":{"id":"https://openalex.org/S4306400423","display_name":"University of Southern Denmark Research Portal (University of Southern Denmark)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I177969490","host_organization_name":"University of Southern Denmark","host_organization_lineage":["https://openalex.org/I177969490"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Brodal, G S, Fagerberg, R, Mailund, T, Pedersen, C N S & Sand, A 2013, Efficient algorithms for computing the triplet and quartet distance between trees of arbitrary degree. in S Khanna (ed.), Proceedings of the 24th Annual ACM-SIAM Symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics, pp. 1814-1832, 24th Annual ACM-SIAM Symposium on Discrete Algorithms , New Orleans, United States, 06/01/2013. https://doi.org/10.1137/1.9781611973105","raw_type":"info:eu-repo/semantics/conferenceObject"},{"id":"pmh:oai:aleph.bib-bvb.de:BVB01-032668678","is_oa":false,"landing_page_url":"https://doi.org/10.1137/1.9781611973105","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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W2899084033","https://openalex.org/W2748952813","https://openalex.org/W2051487156","https://openalex.org/W2073681303","https://openalex.org/W2390279801","https://openalex.org/W4391913857","https://openalex.org/W2358668433","https://openalex.org/W4396701345","https://openalex.org/W2376932109"],"abstract_inverted_index":{"The":[0,17,31,140],"triplet":[1,79,122,147,150],"and":[2,12,43,48,86,123,148,174],"quartet":[3,88,124,164,187],"distances":[4,32,151],"are":[5,33,60],"distance":[6,80,89,165],"measures":[7],"to":[8,76,118,131],"compare":[9],"two":[10,13,21,57,106],"rooted":[11],"unrooted":[14],"trees,":[15],"respectively.":[16],"leaves":[18],"of":[19,28,39,101],"the":[20,25,52,56,78,87,98,105,109,120,146,157,163,180,185],"trees":[22,59],"should":[23],"have":[24,152],"same":[26,110],"set":[27],"n":[29],"labels.":[30],"defined":[34],"by":[35],"enumerating":[36],"all":[37,197],"subsets":[38],"three":[40],"labels":[41,45],"(triplets)":[42],"four":[44],"(quartets),":[46],"respectively,":[47],"counting":[49],"how":[50,75],"often":[51],"induced":[53],"topologies":[54,135],"in":[55,81,90,104],"input":[58],"different.":[61],"In":[62],"this":[63],"paper":[64],"we":[65],"present":[66],"efficient":[67],"algorithms":[68,160,194],"for":[69,144,161],"computing":[70,145,162],"these":[71,198],"distances.":[72],"We":[73],"show":[74],"compute":[77,119,184],"time":[82,91,111,172,177],"O(n":[83],"log":[84,93,170],"n)":[85,171],"O(dn":[92],"n),":[94],"where":[95,126,179],"d":[96,190],"is":[97,129],"maximal":[99],"degree":[100],"any":[102],"node":[103],"trees.":[107],"Within":[108],"bounds,":[112],"our":[113,193],"framework":[114],"also":[115,183],"allows":[116],"us":[117],"parameterized":[121,149,186],"distances,":[125],"a":[127],"parameter":[128],"introduced":[130],"weight":[132],"resolved":[133],"(binary)":[134],"against":[136],"unresolved":[137],"(non-binary)":[138],"topologies.":[139],"previous":[141,158],"best":[142,159],"algorithm":[143,173],"O(n2)":[153],"running":[154],"time,":[155],"while":[156],"include":[166],"an":[167,175],"O(d":[168],"9n":[169],"O(n2.688)":[176],"algorithm,":[178],"latter":[181],"can":[182],"distance.":[188],"Since":[189],"\u2264":[191],"n,":[192],"improve":[195],"on":[196],"algorithms.":[199],"Copyright":[200],"\u00a9":[201],"SIAM.":[202]},"counts_by_year":[{"year":2025,"cited_by_count":9},{"year":2024,"cited_by_count":8},{"year":2023,"cited_by_count":5},{"year":2022,"cited_by_count":5},{"year":2021,"cited_by_count":11},{"year":2020,"cited_by_count":20},{"year":2019,"cited_by_count":9},{"year":2018,"cited_by_count":6},{"year":2017,"cited_by_count":8},{"year":2016,"cited_by_count":8},{"year":2015,"cited_by_count":6},{"year":2013,"cited_by_count":1}],"updated_date":"2026-08-08T01:25:22.217667","created_date":"2016-07-22T00:00:00"}