{"id":"https://openalex.org/W2014239591","doi":"https://doi.org/10.1080/00207169508804419","title":"A new algorithm for minimum spanning tree using depth-first-search in an undirected graph","display_name":"A new algorithm for minimum spanning tree using depth-first-search in an undirected graph","publication_year":1995,"publication_date":"1995-01-01","ids":{"openalex":"https://openalex.org/W2014239591","doi":"https://doi.org/10.1080/00207169508804419","mag":"2014239591"},"language":"en","primary_location":{"id":"doi:10.1080/00207169508804419","is_oa":false,"landing_page_url":"https://doi.org/10.1080/00207169508804419","pdf_url":null,"source":{"id":"https://openalex.org/S124867444","display_name":"International Journal of Computer Mathematics","issn_l":"0020-7160","issn":["0020-7160","1026-7425","1029-0265"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computer Mathematics","raw_type":"journal-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/A5071845292","display_name":"H. Salehi-Fathabadi","orcid":null},"institutions":[{"id":"https://openalex.org/I23946033","display_name":"University of Tehran","ror":"https://ror.org/05vf56z40","country_code":"IR","type":"education","lineage":["https://openalex.org/I23946033"]}],"countries":["IR"],"is_corresponding":true,"raw_author_name":"H. Salehi-Fathabadi","raw_affiliation_strings":["\n Department of Mathematics and Computer Science, Faculty of Science University of Tehran, Tehran, 14174, Iran","Department of Mathematics and Computer Science , Faculty of Science University of Tehran , Tehran, 14174, Iran"],"affiliations":[{"raw_affiliation_string":"\n Department of Mathematics and Computer Science, Faculty of Science University of Tehran, Tehran, 14174, Iran","institution_ids":["https://openalex.org/I23946033"]},{"raw_affiliation_string":"Department of Mathematics and Computer Science , Faculty of Science University of Tehran , Tehran, 14174, Iran","institution_ids":["https://openalex.org/I23946033"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5108205508","display_name":"H. Ahrabian","orcid":null},"institutions":[{"id":"https://openalex.org/I23946033","display_name":"University of Tehran","ror":"https://ror.org/05vf56z40","country_code":"IR","type":"education","lineage":["https://openalex.org/I23946033"]}],"countries":["IR"],"is_corresponding":false,"raw_author_name":"H. Ahrabian","raw_affiliation_strings":["\n Department of Mathematics and Computer Science, Faculty of Science University of Tehran, Tehran, 14174, Iran","Department of Mathematics and Computer Science , Faculty of Science University of Tehran , Tehran, 14174, Iran"],"affiliations":[{"raw_affiliation_string":"\n Department of Mathematics and Computer Science, Faculty of Science University of Tehran, Tehran, 14174, Iran","institution_ids":["https://openalex.org/I23946033"]},{"raw_affiliation_string":"Department of Mathematics and Computer Science , Faculty of Science University of Tehran , Tehran, 14174, Iran","institution_ids":["https://openalex.org/I23946033"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5071845292"],"corresponding_institution_ids":["https://openalex.org/I23946033"],"apc_list":null,"apc_paid":null,"fwci":0.521,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.63170585,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"57","issue":"3-4","first_page":"157","last_page":"161"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9994000196456909,"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.9994000196456909,"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/T11269","display_name":"Algorithms and Data Compression","score":0.9969000220298767,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.993399977684021,"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/spanning-tree","display_name":"Spanning tree","score":0.7506875395774841},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.6691682934761047},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.640882134437561},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6362266540527344},{"id":"https://openalex.org/keywords/reverse-delete-algorithm","display_name":"Reverse-delete algorithm","score":0.6004883050918579},{"id":"https://openalex.org/keywords/kruskals-algorithm","display_name":"Kruskal's algorithm","score":0.5324448347091675},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4688884913921356},{"id":"https://openalex.org/keywords/sorting","display_name":"Sorting","score":0.4338783919811249},{"id":"https://openalex.org/keywords/prims-algorithm","display_name":"Prim's algorithm","score":0.42015624046325684},{"id":"https://openalex.org/keywords/distributed-minimum-spanning-tree","display_name":"Distributed minimum spanning tree","score":0.41973575949668884},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3941303789615631},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.32188183069229126}],"concepts":[{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.7506875395774841},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.6691682934761047},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.640882134437561},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6362266540527344},{"id":"https://openalex.org/C199346575","wikidata":"https://www.wikidata.org/wiki/Q4925151","display_name":"Reverse-delete algorithm","level":4,"score":0.6004883050918579},{"id":"https://openalex.org/C63645285","wikidata":"https://www.wikidata.org/wiki/Q797860","display_name":"Kruskal's algorithm","level":3,"score":0.5324448347091675},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4688884913921356},{"id":"https://openalex.org/C111696304","wikidata":"https://www.wikidata.org/wiki/Q2303697","display_name":"Sorting","level":2,"score":0.4338783919811249},{"id":"https://openalex.org/C1649724","wikidata":"https://www.wikidata.org/wiki/Q470813","display_name":"Prim's algorithm","level":4,"score":0.42015624046325684},{"id":"https://openalex.org/C65949645","wikidata":"https://www.wikidata.org/wiki/Q5283163","display_name":"Distributed minimum spanning tree","level":3,"score":0.41973575949668884},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3941303789615631},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.32188183069229126}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1080/00207169508804419","is_oa":false,"landing_page_url":"https://doi.org/10.1080/00207169508804419","pdf_url":null,"source":{"id":"https://openalex.org/S124867444","display_name":"International Journal of Computer Mathematics","issn_l":"0020-7160","issn":["0020-7160","1026-7425","1029-0265"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computer Mathematics","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":5,"referenced_works":["https://openalex.org/W1484040084","https://openalex.org/W2066904980","https://openalex.org/W2154788235","https://openalex.org/W2752885492","https://openalex.org/W7029321148"],"related_works":["https://openalex.org/W3011323517","https://openalex.org/W4380840098","https://openalex.org/W2899787781","https://openalex.org/W4242086819","https://openalex.org/W2387385213","https://openalex.org/W2074214908","https://openalex.org/W2589768050","https://openalex.org/W2381121915","https://openalex.org/W2898459690","https://openalex.org/W2371157450"],"abstract_inverted_index":{"Abstract":[0],"A":[1],"new":[2],"algorithm":[3,17,23,31],"is":[4,32,47],"presented":[5],"for":[6,58],"the":[7,38,42],"minimum":[8],"spanning":[9],"tree":[10],"problem":[11],"in":[12,45,51],"any":[13,21],"undirected":[14],"graph.":[15],"The":[16,30],"does":[18],"not":[19],"use":[20],"sorting":[22],"or":[24,27],"priority":[25],"queue":[26],"binary":[28],"heaps.":[29],"based":[33],"on":[34],"Depth-First-Search":[35],"(DFS)":[36],"and":[37,64,67],"heaviest":[39],"edge":[40],"of":[41,56],"seen":[43],"cycle":[44],"DFS":[46],"deleted.":[48],"It":[49],"takes":[50],"worst":[52],"case":[53],"a":[54,59],"time":[55],"0(K\u03b5)":[57],"graph":[60],"with":[61],"v":[62],"vertices":[63],"e":[65],"edges":[66],"K":[68],"=":[69],"\u03b5":[70],"\u2014":[71,73],"(v":[72],"1).":[74],"Keywords:":[75],"Spanning":[76],"treeDepth-First-Searchback":[77],"edgeon-tree":[78],"graphacyclic":[79],"graphKeywords:":[80],"C.R.":[81],"CategoriesG.2.1.G.2.2.":[82]},"counts_by_year":[{"year":2015,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}