{"id":"https://openalex.org/W4256176528","doi":"https://doi.org/10.1109/icpp.2004.1327954","title":"The Euler tour technique and parallel rooted spanning tree","display_name":"The Euler tour technique and parallel rooted spanning tree","publication_year":2004,"publication_date":"2004-01-01","ids":{"openalex":"https://openalex.org/W4256176528","doi":"https://doi.org/10.1109/icpp.2004.1327954"},"language":"en","primary_location":{"id":"doi:10.1109/icpp.2004.1327954","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icpp.2004.1327954","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Conference on Parallel Processing, 2004. ICPP 2004.","raw_type":"proceedings-article"},"type":"article","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/A5071270440","display_name":"Guojin Cong","orcid":null},"institutions":[{"id":"https://openalex.org/I169521973","display_name":"University of New Mexico","ror":"https://ror.org/05fs6jp91","country_code":"US","type":"education","lineage":["https://openalex.org/I169521973"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Guojin Cong","raw_affiliation_strings":["Department of Electrical and Computer Engineering, University of New Mexico, Albuquerque, NM, USA"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of New Mexico, Albuquerque, NM, USA","institution_ids":["https://openalex.org/I169521973"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5076610730","display_name":"David A. Bader","orcid":"https://orcid.org/0000-0002-7380-5876"},"institutions":[{"id":"https://openalex.org/I169521973","display_name":"University of New Mexico","ror":"https://ror.org/05fs6jp91","country_code":"US","type":"education","lineage":["https://openalex.org/I169521973"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"D.A. Bader","raw_affiliation_strings":["Department of Electrical and Computer Engineering, University of New Mexico, Albuquerque, NM, USA"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of New Mexico, Albuquerque, NM, USA","institution_ids":["https://openalex.org/I169521973"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5071270440"],"corresponding_institution_ids":["https://openalex.org/I169521973"],"apc_list":null,"apc_paid":null,"fwci":1.3486,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.82361624,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"448","last_page":"457 vol.1"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9994999766349792,"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"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9994999766349792,"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"}},{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9987000226974487,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T11269","display_name":"Algorithms and Data Compression","score":0.9973999857902527,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.794863224029541},{"id":"https://openalex.org/keywords/tree-traversal","display_name":"Tree traversal","score":0.6956357359886169},{"id":"https://openalex.org/keywords/adjacency-list","display_name":"Adjacency list","score":0.6322653293609619},{"id":"https://openalex.org/keywords/gomory\u2013hu-tree","display_name":"Gomory\u2013Hu tree","score":0.6131032705307007},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.612666130065918},{"id":"https://openalex.org/keywords/k-ary-tree","display_name":"K-ary tree","score":0.5624091029167175},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5085586309432983},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5047942399978638},{"id":"https://openalex.org/keywords/interval-tree","display_name":"Interval tree","score":0.4873815178871155},{"id":"https://openalex.org/keywords/kruskals-algorithm","display_name":"Kruskal's algorithm","score":0.4846790134906769},{"id":"https://openalex.org/keywords/segment-tree","display_name":"Segment tree","score":0.4728567600250244},{"id":"https://openalex.org/keywords/shortest-path-tree","display_name":"Shortest-path tree","score":0.46535784006118774},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4646123945713043},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.45120254158973694},{"id":"https://openalex.org/keywords/minimum-degree-spanning-tree","display_name":"Minimum degree spanning tree","score":0.44416895508766174},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.41526979207992554},{"id":"https://openalex.org/keywords/search-tree","display_name":"Search tree","score":0.31461435556411743},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.26913201808929443},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.16759535670280457},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.13510844111442566}],"concepts":[{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.794863224029541},{"id":"https://openalex.org/C140745168","wikidata":"https://www.wikidata.org/wiki/Q1210082","display_name":"Tree traversal","level":2,"score":0.6956357359886169},{"id":"https://openalex.org/C110484373","wikidata":"https://www.wikidata.org/wiki/Q264398","display_name":"Adjacency list","level":2,"score":0.6322653293609619},{"id":"https://openalex.org/C147517495","wikidata":"https://www.wikidata.org/wiki/Q5581241","display_name":"Gomory\u2013Hu tree","level":5,"score":0.6131032705307007},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.612666130065918},{"id":"https://openalex.org/C100560664","wikidata":"https://www.wikidata.org/wiki/Q3608019","display_name":"K-ary tree","level":4,"score":0.5624091029167175},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5085586309432983},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5047942399978638},{"id":"https://openalex.org/C84927040","wikidata":"https://www.wikidata.org/wiki/Q6057306","display_name":"Interval tree","level":4,"score":0.4873815178871155},{"id":"https://openalex.org/C63645285","wikidata":"https://www.wikidata.org/wiki/Q797860","display_name":"Kruskal's algorithm","level":3,"score":0.4846790134906769},{"id":"https://openalex.org/C94557470","wikidata":"https://www.wikidata.org/wiki/Q2377385","display_name":"Segment tree","level":5,"score":0.4728567600250244},{"id":"https://openalex.org/C23394520","wikidata":"https://www.wikidata.org/wiki/Q4919350","display_name":"Shortest-path tree","level":3,"score":0.46535784006118774},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4646123945713043},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.45120254158973694},{"id":"https://openalex.org/C64271015","wikidata":"https://www.wikidata.org/wiki/Q6865444","display_name":"Minimum degree spanning tree","level":3,"score":0.44416895508766174},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.41526979207992554},{"id":"https://openalex.org/C207024777","wikidata":"https://www.wikidata.org/wiki/Q621673","display_name":"Search tree","level":3,"score":0.31461435556411743},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.26913201808929443},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.16759535670280457},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.13510844111442566}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icpp.2004.1327954","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icpp.2004.1327954","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Conference on Parallel Processing, 2004. ICPP 2004.","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities","score":0.5600000023841858}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W78403084","https://openalex.org/W1569498258","https://openalex.org/W1927942528","https://openalex.org/W1995040285","https://openalex.org/W2004350101","https://openalex.org/W2028583484","https://openalex.org/W2086825382","https://openalex.org/W2094900885","https://openalex.org/W2107474728","https://openalex.org/W2120490947","https://openalex.org/W2132750992","https://openalex.org/W2398460325","https://openalex.org/W4210777595","https://openalex.org/W4239964018","https://openalex.org/W4253639210","https://openalex.org/W6603233266","https://openalex.org/W6633986585","https://openalex.org/W6640609428","https://openalex.org/W6657721698","https://openalex.org/W6712654496","https://openalex.org/W6821703120"],"related_works":["https://openalex.org/W1997570556","https://openalex.org/W1514905840","https://openalex.org/W2058332489","https://openalex.org/W2071845176","https://openalex.org/W3141326665","https://openalex.org/W2943635264","https://openalex.org/W3151045290","https://openalex.org/W2163139704","https://openalex.org/W4256176528","https://openalex.org/W130518292"],"abstract_inverted_index":{"Many":[0],"parallel":[1],"algorithms":[2,150],"for":[3,105,219,244,275],"graph":[4],"problems":[5,221],"start":[6],"with":[7,255],"finding":[8,68],"a":[9,55,89,114,129,195,203,216,229,233],"spanning":[10,41,47,60,70,107,115,140,154,171,235],"tree":[11,15,42,48,61,108,116,141,172,236,246,276],"and":[12,43,63,142,162,199,227],"rooting":[13,228],"the":[14,22,46,50,82,101,106,111,158,169,186,200,207,220,224,245,259,280],"to":[16,37,99],"define":[17],"some":[18],"structural":[19],"relationship":[20],"on":[21,77,110],"vertices":[23],"which":[24],"can":[25,72,272],"be":[26,73,273],"used":[27,274],"by":[28,113],"following":[29],"problem":[30],"specific":[31],"computations.":[32],"The":[33,212,250],"generic":[34],"procedure":[35],"is":[36,94,190,194,202,253],"find":[38,152],"an":[39,240,266],"unrooted":[40,59],"then":[44,238],"root":[45],"using":[49,157,247],"Euler":[51,83,159,182,225,241],"tour":[52,84,160,226,242,251,260],"technique.":[53],"With":[54],"randomized":[56,204,213],"work-time":[57,64,75],"optimal":[58,65],"algorithm":[62,198,205,214],"list":[66,104,132,143,189],"ranking,":[67],"rooted":[69,153,234],"trees":[71,155],"done":[74],"optimally":[76],"EREW":[78],"PRAM":[79,197],"w.h.p.":[80],"Yet":[81],"technique":[85,161],"assumes":[86],"as":[87,135,138],"\"given\"":[88],"circular":[90,102,130,187],"adjacency":[91,103,131,188],"list,":[92],"it":[93],"not":[95,191],"without":[96,156],"implications":[97],"though":[98],"construct":[100,181],"found":[109],"fly":[112],"algorithm.":[117],"In":[118],"fact":[119],"our":[120],"experiments":[121],"show":[122],"that":[123,151,180,269],"this":[124],"\"hidden\"":[125],"step":[126],"of":[127,222,265,279],"constructing":[128,223],"could":[133],"take":[134],"much":[136],"time":[137],"both":[139],"ranking":[144],"combined.":[145],"We":[146,174],"present":[147,176],"new":[148,178],"efficient":[149],"incur":[163],"little":[164],"or":[165],"no":[166],"overhead":[167],"over":[168],"underlying":[170],"algorithms.":[173],"also":[175],"two":[177],"approaches":[179],"tours":[183],"efficiently":[184],"when":[185],"given.":[192],"One":[193],"deterministic":[196],"other":[201],"in":[206,258,262],"symmetric":[208],"multiprocessor":[209],"(SMP)":[210],"model.":[211],"takes":[215],"novel":[217],"approach":[218],"tree.":[230],"It":[231],"computes":[232],"first,":[237],"constructs":[239],"directly":[243],"depth-first":[248],"traversal.":[249],"constructed":[252],"cache-friendly":[254],"adjacent":[256],"edges":[257],"stored":[261],"consecutive":[263],"locations":[264],"array":[267],"so":[268],"prefix-sum":[270],"(scan)":[271],"computations":[277],"instead":[278],"more":[281],"expensive":[282],"list-ranking.":[283]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}