{"id":"https://openalex.org/W2550952896","doi":"https://doi.org/10.1145/3108240","title":"A Data Structure for Nearest Common Ancestors with Linking","display_name":"A Data Structure for Nearest Common Ancestors with Linking","publication_year":2017,"publication_date":"2017-09-19","ids":{"openalex":"https://openalex.org/W2550952896","doi":"https://doi.org/10.1145/3108240","mag":"2550952896"},"language":"en","primary_location":{"id":"doi:10.1145/3108240","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3108240","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3108240","source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3108240","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5001013961","display_name":"Harold N. Gabow","orcid":"https://orcid.org/0000-0002-9775-3492"},"institutions":[{"id":"https://openalex.org/I188538660","display_name":"University of Colorado Boulder","ror":"https://ror.org/02ttsq026","country_code":"US","type":"education","lineage":["https://openalex.org/I188538660"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Harold N. Gabow","raw_affiliation_strings":["University of Colorado at Boulder, Boulder, Colorado, USA"],"affiliations":[{"raw_affiliation_string":"University of Colorado at Boulder, Boulder, Colorado, USA","institution_ids":["https://openalex.org/I188538660"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5001013961"],"corresponding_institution_ids":["https://openalex.org/I188538660"],"apc_list":null,"apc_paid":null,"fwci":0.2079,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.61245069,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"13","issue":"4","first_page":"1","last_page":"28"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T11269","display_name":"Algorithms and Data Compression","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T11321","display_name":"Error Correcting Code Techniques","score":0.9944000244140625,"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/T12029","display_name":"DNA and Biological Computing","score":0.9929999709129333,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6070877909660339},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.520740270614624},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.5145429968833923},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5114454030990601},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.49322885274887085},{"id":"https://openalex.org/keywords/link","display_name":"Link (geometry)","score":0.4593598544597626},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4451936185359955},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4392467141151428},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.4330289661884308},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.43050527572631836},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4260585308074951},{"id":"https://openalex.org/keywords/k-ary-tree","display_name":"K-ary tree","score":0.42143556475639343},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.41332104802131653},{"id":"https://openalex.org/keywords/search-tree","display_name":"Search tree","score":0.41097187995910645},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3641870617866516},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.35887622833251953},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.3469279706478119},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.17750445008277893},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.14723339676856995}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6070877909660339},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.520740270614624},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.5145429968833923},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5114454030990601},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.49322885274887085},{"id":"https://openalex.org/C2778753846","wikidata":"https://www.wikidata.org/wiki/Q6554239","display_name":"Link (geometry)","level":2,"score":0.4593598544597626},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4451936185359955},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4392467141151428},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.4330289661884308},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.43050527572631836},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4260585308074951},{"id":"https://openalex.org/C100560664","wikidata":"https://www.wikidata.org/wiki/Q3608019","display_name":"K-ary tree","level":4,"score":0.42143556475639343},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.41332104802131653},{"id":"https://openalex.org/C207024777","wikidata":"https://www.wikidata.org/wiki/Q621673","display_name":"Search tree","level":3,"score":0.41097187995910645},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3641870617866516},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.35887622833251953},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.3469279706478119},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.17750445008277893},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.14723339676856995},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3108240","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3108240","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3108240","source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1145/3108240","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3108240","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3108240","source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","raw_type":"journal-article"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/15","score":0.6100000143051147,"display_name":"Life in Land"}],"awards":[{"id":"https://openalex.org/G6805329777","display_name":null,"funder_award_id":"CCR-8815636","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2550952896.pdf","grobid_xml":"https://content.openalex.org/works/W2550952896.grobid-xml"},"referenced_works_count":25,"referenced_works":["https://openalex.org/W178414959","https://openalex.org/W938539187","https://openalex.org/W1513400187","https://openalex.org/W1522375947","https://openalex.org/W1579194992","https://openalex.org/W1990061958","https://openalex.org/W2004116976","https://openalex.org/W2011999472","https://openalex.org/W2018804864","https://openalex.org/W2023658462","https://openalex.org/W2028503265","https://openalex.org/W2046946959","https://openalex.org/W2054420170","https://openalex.org/W2066362074","https://openalex.org/W2092901467","https://openalex.org/W2096967468","https://openalex.org/W2123790255","https://openalex.org/W2124852572","https://openalex.org/W2137120608","https://openalex.org/W2327315803","https://openalex.org/W2610179052","https://openalex.org/W2951106886","https://openalex.org/W2988480584","https://openalex.org/W3145128584","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2349743712","https://openalex.org/W1559350420","https://openalex.org/W2227630426","https://openalex.org/W2227684440","https://openalex.org/W1529499406","https://openalex.org/W2549663625","https://openalex.org/W2150988524","https://openalex.org/W2359095153","https://openalex.org/W2156833871","https://openalex.org/W2566588687"],"abstract_inverted_index":{"Consider":[0],"a":[1,18,47,57,85,95,99,103,112,117,168],"forest":[2,58],"that":[3,8,46],"evolves":[4],"via":[5],"link":[6,25,54,89,96],"operations":[7,26,55],"make":[9],"the":[10,15,32,124,156,173],"root":[11],"of":[12,17,36,49,59,88,126,158,172,178],"one":[13],"tree":[14,100],"child":[16],"node":[19],"in":[20,66,107,129],"another":[21],"tree.":[22],"Intermixed":[23],"with":[24],"are":[27,155],"nca":[28,52],"operations,":[29],"which":[30],"return":[31],"nearest":[33],"common":[34],"ancestor":[35],"two":[37],"given":[38],"nodes":[39,61],"when":[40],"such":[41,51],"exists.":[42],"This":[43,79],"article":[44],"shows":[45],"sequence":[48],"m":[50,70,73,137,154],"and":[53,153,160,180],"on":[56,116],"n":[60,75,77,135,139,141,152],"can":[62],"be":[63],"processed":[64],"online":[65],"time":[67,132],"O":[68,133],"(":[69,72,134,136,151],"\u03b1":[71],",":[74],")+":[76],").":[78],"was":[80],"previously":[81],"known":[82],"only":[83,97],"for":[84,110,143],"restricted":[86],"type":[87],"operation.":[90],"The":[91],"special":[92],"case":[93],"where":[94],"extends":[98],"by":[101],"adding":[102],"new":[104],"leaf":[105],"occurs":[106],"Edmonds\u2019":[108,127],"algorithm":[109,122,128,177],"finding":[111],"maximum":[113],"weight":[114],"matching":[115],"general":[118],"graph.":[119],"Incorporating":[120],"our":[121],"into":[123],"implementation":[125,171],"[9]":[130],"achieves":[131],"+":[138],"log":[140],"))":[142],"weighted":[144],"matching,":[145],"an":[146],"arguably":[147],"optimum":[148],"asymptotic":[149],"bound":[150],"number":[157],"vertices":[159],"edges,":[161],"respectively).":[162],"Our":[163],"data":[164],"structure":[165],"also":[166],"provides":[167],"simple":[169],"alternative":[170],"incremental-tree":[174],"set":[175],"merging":[176],"Gabow":[179],"Tarjan":[181],"[11].":[182]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2018,"cited_by_count":1}],"updated_date":"2026-04-21T08:09:41.155169","created_date":"2025-10-10T00:00:00"}