{"id":"https://openalex.org/W6992818634","doi":null,"title":"Minimum Spanning Tree Algorithms, one-dimensional ranking and comparison.","display_name":"Minimum Spanning Tree Algorithms, one-dimensional ranking and comparison.","alternate_titles":[],"publication_year":2021,"publication_date":"2021-09-17","ids":{"openalex":"https://openalex.org/W6992818634"},"language":"en","primary_location":{"id":"pmh:oai:estudogeral.uc.pt:10316/96121","doi":null,"is_oa":true,"landing_page_url":"https://hdl.handle.net/10316/96121","pdf_url":"https://estudogeral.uc.pt/bitstream/10316/96121/1/Thesis.pdf","source":{"id":"https://openalex.org/S4306402433","display_name":"Portuguese National Funding Agency for Science, Research and Technology (RCAAP Project by FCT)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"master thesis"},"parent_works":[],"lineage":["https://openalex.org/W6992818634"],"child_works_count":0,"type":"dissertation","is_traditional":true,"indexed_in":[],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://estudogeral.uc.pt/bitstream/10316/96121/1/Thesis.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Frieden, Marco Henrik","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Frieden, Marco Henrik","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":true,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9990000128746033,"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.9990000128746033,"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.00039999998989515007,"subfield":{"id":"https://openalex.org/subfields/2614","display_name":"Theoretical Computer Science"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.0003000000142492354,"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/minimum-spanning-tree","display_name":"minimum spanning tree","score":0.8669999837875366},{"id":"https://openalex.org/keywords/kruskal-s-algorithm","display_name":"Kruskal's algorithm","score":0.890999972820282},{"id":"https://openalex.org/keywords/prim-s-algorithm","display_name":"Prim's algorithm","score":1.0},{"id":"https://openalex.org/keywords/heap-data-structures","display_name":"heap data structures","score":0.7360000014305115},{"id":"https://openalex.org/keywords/binary-heaps","display_name":"binary heaps","score":0.7590000033378601},{"id":"https://openalex.org/keywords/fibonacci-heaps","display_name":"Fibonacci heaps","score":0.9980000257492065},{"id":"https://openalex.org/keywords/complete-graphs","display_name":"complete graphs","score":0.9380000233650208}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5336999893188477},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.5245000123977661},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.4715999960899353},{"id":"https://openalex.org/C189430467","wikidata":"https://www.wikidata.org/wiki/Q7293293","display_name":"Ranking (information retrieval)","level":2,"score":0.396699994802475},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.37040001153945923},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.36970001459121704},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.28700000047683716},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2549999952316284},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.2443999946117401},{"id":"https://openalex.org/C61797465","wikidata":"https://www.wikidata.org/wiki/Q1188986","display_name":"Term (time)","level":2,"score":0.24379999935626984}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:estudogeral.uc.pt:10316/96121","doi":null,"is_oa":true,"landing_page_url":"https://hdl.handle.net/10316/96121","pdf_url":"https://estudogeral.uc.pt/bitstream/10316/96121/1/Thesis.pdf","source":{"id":"https://openalex.org/S4306402433","display_name":"Portuguese National Funding Agency for Science, Research and Technology (RCAAP Project by FCT)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"master thesis"},{"id":"pmh:oai:estudogeral.sib.uc.pt:10316/96121","doi":null,"is_oa":false,"landing_page_url":"http://hdl.handle.net/10316/96121","pdf_url":null,"source":{"id":"https://openalex.org/S4306402433","display_name":"Portuguese National Funding Agency for Science, Research and Technology (RCAAP Project by FCT)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"http://purl.org/coar/resource_type/c_bdcc"}],"best_oa_location":{"id":"pmh:oai:estudogeral.uc.pt:10316/96121","doi":null,"is_oa":true,"landing_page_url":"https://hdl.handle.net/10316/96121","pdf_url":"https://estudogeral.uc.pt/bitstream/10316/96121/1/Thesis.pdf","source":{"id":"https://openalex.org/S4306402433","display_name":"Portuguese National Funding Agency for Science, Research and Technology (RCAAP Project by FCT)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"master thesis"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W6992818634.pdf","grobid_xml":"https://content.openalex.org/works/W6992818634.grobid-xml"},"referenced_works_count":28,"referenced_works":["https://openalex.org/W344142806","https://openalex.org/W1664309637","https://openalex.org/W1965680834","https://openalex.org/W1970691969","https://openalex.org/W1972969203","https://openalex.org/W1977463365","https://openalex.org/W1982512167","https://openalex.org/W2006156823","https://openalex.org/W2017927472","https://openalex.org/W2023286509","https://openalex.org/W2028430839","https://openalex.org/W2032841680","https://openalex.org/W2041786457","https://openalex.org/W2053084063","https://openalex.org/W2061116853","https://openalex.org/W2071346873","https://openalex.org/W2077371116","https://openalex.org/W2084224084","https://openalex.org/W2084642062","https://openalex.org/W2100831780","https://openalex.org/W2138987445","https://openalex.org/W2151285717","https://openalex.org/W2155086352","https://openalex.org/W2169528473","https://openalex.org/W2274522983","https://openalex.org/W2887060483","https://openalex.org/W2949855858","https://openalex.org/W3198470706"],"related_works":["https://openalex.org/W7002093976","https://openalex.org/W7172235818","https://openalex.org/W2481977957","https://openalex.org/W3116744857","https://openalex.org/W4390460200","https://openalex.org/W3191415409","https://openalex.org/W7002221249","https://openalex.org/W7099483021","https://openalex.org/W4213195740","https://openalex.org/W4253639210"],"abstract_inverted_index":{"Neste":[0],"trabalho":[1],"focamo-nos":[2],"no":[3,20,81],"problema":[4,25],"de":[5,7,15,29,36,43,56,63,107,119],"\u00e1rvores":[6,106],"cobertura":[8],"m\u00ednima":[9],"(MST)":[10],"e":[11,48,54,65,96,126],"em":[12,89,110,123],"implementa\u00e7\u00f5es":[13,35,122],"eficientes":[14],"o":[16,128,136],"resolver,":[17],"tal":[18],"como":[19,37,46,51],"estudo":[21],"da":[22],"variante":[23],"do":[24],"cl\u00e1ssico":[26],"-":[27],"ranking":[28],"MST's.":[30],"Em":[31],"particular,":[32],"estudamos":[33,95],"diferentes":[34,70],"obter":[38],"estas":[39,121],"\u00e1rvores,":[40],"usando":[41],"estruturas":[42],"dados":[44],"simples,":[45],"listas,":[47],"mais":[49],"complexas,":[50],"\\textit{heaps}":[52,55],"bin\u00e1rias":[53],"Fibonacci.":[57],"Usando":[58],"os":[59],"largamente":[60],"conhecidos":[61],"algoritmos":[62],"Kruskal":[64],"Prim,":[66],"comparamos":[67],"todas":[68],"as":[69],"implementa\u00e7\u00f5es,":[71],"provando":[72],"a":[73,101,112,117],"grande":[74],"efici\u00eancia":[75],"destas":[76],"estruras":[77],"\\textit{heap},":[78],"n\u00e3o":[79],"apenas":[80],"sentido":[82],"te\u00f3rico":[83],"mas":[84],"comprovando":[85],"com":[86,116],"testes":[87],"pr\u00e1ticos,":[88],"particular":[90],"para":[91,100,130,135],"grafos":[92,124],"completos.":[93],"Tamb\u00e9m":[94],"desenvolvemos":[97],"um":[98],"algoritmo":[99],"obten\u00e7\u00e3o":[102],"das":[103],"$k$":[104],"melhores":[105],"cobertura.":[108],"Deixamos":[109],"aberto":[111],"continua\u00e7\u00e3o":[113],"deste":[114],"trabalho,":[115],"sujest\u00e3o":[118],"aplicar":[120],"multi-objetivo":[125],"usar":[127],"investigado":[129],"criar":[131],"uma":[132],"aplica\u00e7\u00e3o":[133],"pr\u00e1tica":[134],"mundo":[137],"corporativo":[138],"ou":[139],"industrial.--------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------":[140]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W6992818634","counts_by_year":[],"updated_date":"2026-11-16T12:05:36.265796","created_date":"2025-10-10T00:00:00"}
