{"id":"https://openalex.org/W1849362181","doi":"https://doi.org/10.1109/ipdps.2004.1302951","title":"A fast, parallel spanning tree algorithm for symmetric multiprocessors (SMPs)(extended abstract )","display_name":"A fast, parallel spanning tree algorithm for symmetric multiprocessors (SMPs)(extended abstract )","publication_year":2004,"publication_date":"2004-06-10","ids":{"openalex":"https://openalex.org/W1849362181","doi":"https://doi.org/10.1109/ipdps.2004.1302951","mag":"1849362181"},"language":"en","primary_location":{"id":"doi:10.1109/ipdps.2004.1302951","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ipdps.2004.1302951","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"18th International Parallel and Distributed Processing Symposium, 2004. Proceedings.","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/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":true,"raw_author_name":"D.A. Bader","raw_affiliation_strings":["Electrical and Computer Engineering Department, University of New Mexico, Albuquerque, NM, USA","Dept. of Electr. & Comput. Eng., New Mexico Univ., Albuquerque, NM, USA"],"affiliations":[{"raw_affiliation_string":"Electrical and Computer Engineering Department, University of New Mexico, Albuquerque, NM, USA","institution_ids":["https://openalex.org/I169521973"]},{"raw_affiliation_string":"Dept. of Electr. & Comput. Eng., New Mexico Univ., Albuquerque, NM, USA","institution_ids":["https://openalex.org/I169521973"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5089801879","display_name":"Guojing Cong","orcid":"https://orcid.org/0000-0003-0850-7714"},"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":"Guojing Cong","raw_affiliation_strings":["Electrical and Computer Engineering Department, University of New Mexico, Albuquerque, NM, USA"],"affiliations":[{"raw_affiliation_string":"Electrical and Computer Engineering Department, 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/A5076610730"],"corresponding_institution_ids":["https://openalex.org/I169521973"],"apc_list":null,"apc_paid":null,"fwci":5.732,"has_fulltext":false,"cited_by_count":31,"citation_normalized_percentile":{"value":0.96259083,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"14","issue":null,"first_page":"38","last_page":"47"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9988999962806702,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9988999962806702,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9987999796867371,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9976000189781189,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/speedup","display_name":"Speedup","score":0.8514994978904724},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7896769046783447},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.7111917734146118},{"id":"https://openalex.org/keywords/parallel-algorithm","display_name":"Parallel algorithm","score":0.6218963861465454},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.6126634478569031},{"id":"https://openalex.org/keywords/locality","display_name":"Locality","score":0.4843650758266449},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.452758252620697},{"id":"https://openalex.org/keywords/network-topology","display_name":"Network topology","score":0.44066083431243896},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4048444926738739},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.33104562759399414},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.17629775404930115},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.10705715417861938}],"concepts":[{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.8514994978904724},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7896769046783447},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.7111917734146118},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.6218963861465454},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.6126634478569031},{"id":"https://openalex.org/C2779808786","wikidata":"https://www.wikidata.org/wiki/Q6664603","display_name":"Locality","level":2,"score":0.4843650758266449},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.452758252620697},{"id":"https://openalex.org/C199845137","wikidata":"https://www.wikidata.org/wiki/Q145490","display_name":"Network topology","level":2,"score":0.44066083431243896},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4048444926738739},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.33104562759399414},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.17629775404930115},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.10705715417861938},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/ipdps.2004.1302951","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ipdps.2004.1302951","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"18th International Parallel and Distributed Processing Symposium, 2004. Proceedings.","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":50,"referenced_works":["https://openalex.org/W78403084","https://openalex.org/W1485262373","https://openalex.org/W1513982482","https://openalex.org/W1545943120","https://openalex.org/W1569498258","https://openalex.org/W1600475114","https://openalex.org/W1821591339","https://openalex.org/W1839908347","https://openalex.org/W1927942528","https://openalex.org/W1964225906","https://openalex.org/W1976398917","https://openalex.org/W1978624651","https://openalex.org/W1993297915","https://openalex.org/W2001383125","https://openalex.org/W2004350101","https://openalex.org/W2028583484","https://openalex.org/W2033887412","https://openalex.org/W2039757598","https://openalex.org/W2039895055","https://openalex.org/W2050866845","https://openalex.org/W2053482409","https://openalex.org/W2062939617","https://openalex.org/W2069446854","https://openalex.org/W2078629151","https://openalex.org/W2085467310","https://openalex.org/W2086632974","https://openalex.org/W2086825382","https://openalex.org/W2094900885","https://openalex.org/W2101195691","https://openalex.org/W2103512074","https://openalex.org/W2106960349","https://openalex.org/W2107474728","https://openalex.org/W2120490947","https://openalex.org/W2125182537","https://openalex.org/W2129137345","https://openalex.org/W2138304862","https://openalex.org/W2148686552","https://openalex.org/W2151440203","https://openalex.org/W2153075575","https://openalex.org/W2155086352","https://openalex.org/W2398460325","https://openalex.org/W4210777595","https://openalex.org/W4239964018","https://openalex.org/W4253639210","https://openalex.org/W6603233266","https://openalex.org/W6630645706","https://openalex.org/W6633986585","https://openalex.org/W6675267351","https://openalex.org/W6712654496","https://openalex.org/W6821703120"],"related_works":["https://openalex.org/W2418231958","https://openalex.org/W2099915933","https://openalex.org/W3116169590","https://openalex.org/W1703428550","https://openalex.org/W4380840098","https://openalex.org/W2044443696","https://openalex.org/W2503538928","https://openalex.org/W3101281637","https://openalex.org/W2390742649","https://openalex.org/W1561849181"],"abstract_inverted_index":{"Summary":[0],"form":[1],"only":[2,86],"given.":[3],"We":[4,113],"focus":[5],"on":[6,12,73,90,104,131,200],"implementing":[7,201],"parallel":[8,32,66,83,129,188,206],"spanning":[9,77,149,180],"tree":[10,15,78,181],"algorithms":[11,34,203,213],"SMPs.":[13],"Spanning":[14],"is":[16,25,39,183,214],"an":[17,159],"important":[18],"problem":[19,182],"in":[20,225],"the":[21,26,126,142,167,179],"sense":[22],"that":[23,49,94,124,163],"it":[24,38],"building":[27],"block":[28],"for":[29,125,146,172,186,204,211],"many":[30],"other":[31],"graph":[33,92],"and":[35,52,56,79,119,136,239],"also":[36],"because":[37],"representative":[40],"of":[41,45,111,170],"a":[42,115,148],"large":[43,174],"class":[44],"irregular":[46,137],"combinatorial":[47],"problems":[48,75],"have":[50,62,70],"simple":[51],"efficient":[53,65],"sequential":[54,144],"implementations":[55],"fast":[57],"PRAM":[58,202],"algorithms,":[59],"but":[60,85],"often":[61],"no":[63],"known":[64],"implementations.":[67],"Experimental":[68],"studies":[69],"been":[71],"conducted":[72],"related":[74],"(minimum":[76],"connected":[80],"components)":[81],"using":[82],"computers,":[84],"achieved":[87],"reasonable":[88,192],"speedup":[89,130],"regular":[91,135],"topologies":[93],"can":[95],"be":[96],"implicitly":[97],"partitioned":[98],"with":[99,108,121,141,166],"good":[100],"locality":[101],"features":[102],"or":[103],"very":[105],"dense":[106],"graphs":[107,133],"limited":[109],"numbers":[110],"vertices.":[112],"present":[114],"new":[116,152,198],"randomized":[117],"algorithm":[118,153],"implementation":[120,145,189],"superior":[122],"performance":[123],"first-time":[127],"achieves":[128],"arbitrary":[132],"(both":[134],"topologies)":[138],"when":[139],"compared":[140],"best":[143],"finding":[147],"tree.":[150],"This":[151,221],"uses":[154],"several":[155],"techniques":[156],"to":[157,190],"give":[158],"expected":[160],"running":[161],"time":[162],"scales":[164],"linearly":[165],"number":[168],"p":[169],"processors":[171],"suitably":[173],"inputs":[175],"(n>p/sup":[176],"2/).":[177],"As":[178],"notoriously":[184],"hard":[185],"any":[187],"achieve":[191],"speedup,":[193],"our":[194,217],"study":[195],"may":[196],"shed":[197],"light":[199],"shared-memory":[205],"computers.":[207],"The":[208],"source":[209],"code":[210],"these":[212],"freely-available":[215],"from":[216],"Web":[218],"site":[219],"hpc.ece.unm.edu.":[220],"work":[222],"was":[223],"supported":[224],"part":[226],"by":[227],"NSF":[228],"Grants":[229],"CAREER":[230],"ACI-00-93039,":[231],"ITR":[232,235,240],"ACI-00-81404,":[233],"DEB-99-10123,":[234],"EIA-01-21377,":[236],"Biocomplexity":[237],"DEB-01-20709,":[238],"EF/BIO":[241],"03-31654.":[242]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":3},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}