{"id":"https://openalex.org/W7213686142","doi":null,"title":"Finding the shortest path in a simple connected graph","display_name":"Finding the shortest path in a simple connected graph","alternate_titles":[],"publication_year":2026,"publication_date":"2026-09-16","ids":{"openalex":"https://openalex.org/W7213686142"},"language":"sl","primary_location":{"id":"pmh:oai:repozitorij.uni-lj.si:IzpisGradiva.php?id=187892","doi":null,"is_oa":true,"landing_page_url":"https://plus.cobiss.net/cobiss/si/sl/bib/292243715","pdf_url":"https://repozitorij.uni-lj.si/Dokument.php?lang=slv&id=247721&dn=","source":{"id":"https://openalex.org/S4377196268","display_name":"Repository of the University of Ljubljana (University of Ljubljana)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I153976015","host_organization_name":"University of Ljubljana","host_organization_lineage":["https://openalex.org/I153976015"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":null,"raw_type":"info:eu-repo/semantics/bachelorThesis"},"parent_works":[],"lineage":["https://openalex.org/W7213686142"],"child_works_count":0,"type":"dissertation","is_traditional":true,"indexed_in":[],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://repozitorij.uni-lj.si/Dokument.php?lang=slv&id=247721&dn=","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5152165358","display_name":"Martin Igli\u010d","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Igli\u010d, Martin","raw_affiliation_strings":["Ljubljana , 2026"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Ljubljana , 2026","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5152165358"],"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":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.8179000020027161,"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.8179000020027161,"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.17829999327659607,"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.0010000000474974513,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/shortest-path","display_name":"shortest path","score":0.968999981880188},{"id":"https://openalex.org/keywords/dijkstra-s-algorithm","display_name":"Dijkstra's algorithm","score":0.9139999747276306},{"id":"https://openalex.org/keywords/a-algorithm","display_name":"A* algorithm","score":0.8769999742507935},{"id":"https://openalex.org/keywords/exhaustive-search","display_name":"exhaustive search","score":0.6439999938011169},{"id":"https://openalex.org/keywords/local-search","display_name":"local search","score":0.7239999771118164},{"id":"https://openalex.org/keywords/graph-data-structures","display_name":"graph data structures","score":0.7329999804496765},{"id":"https://openalex.org/keywords/algorithmic-efficiency","display_name":"algorithm efficiency","score":0.4569999873638153},{"id":"https://openalex.org/keywords/path-optimization","display_name":"path optimization","score":0.4429999887943268}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6868000030517578},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5565999746322632},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.453000009059906},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.436599999666214},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.43160000443458557},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4311999976634979},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3921999931335449},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.3398999869823456},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.3328000009059906},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3287000060081482},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.3140000104904175},{"id":"https://openalex.org/C54385418","wikidata":"https://www.wikidata.org/wiki/Q2742711","display_name":"Distance","level":4,"score":0.30160000920295715},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2888000011444092},{"id":"https://openalex.org/C61797465","wikidata":"https://www.wikidata.org/wiki/Q1188986","display_name":"Term (time)","level":2,"score":0.27000001072883606},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.259799987077713},{"id":"https://openalex.org/C5134670","wikidata":"https://www.wikidata.org/wiki/Q1626444","display_name":"Cut","level":4,"score":0.25859999656677246},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.25380000472068787}],"mesh":[],"locations_count":1,"locations":[{"id":"pmh:oai:repozitorij.uni-lj.si:IzpisGradiva.php?id=187892","doi":null,"is_oa":true,"landing_page_url":"https://plus.cobiss.net/cobiss/si/sl/bib/292243715","pdf_url":"https://repozitorij.uni-lj.si/Dokument.php?lang=slv&id=247721&dn=","source":{"id":"https://openalex.org/S4377196268","display_name":"Repository of the University of Ljubljana (University of Ljubljana)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I153976015","host_organization_name":"University of Ljubljana","host_organization_lineage":["https://openalex.org/I153976015"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":null,"raw_type":"info:eu-repo/semantics/bachelorThesis"}],"best_oa_location":{"id":"pmh:oai:repozitorij.uni-lj.si:IzpisGradiva.php?id=187892","doi":null,"is_oa":true,"landing_page_url":"https://plus.cobiss.net/cobiss/si/sl/bib/292243715","pdf_url":"https://repozitorij.uni-lj.si/Dokument.php?lang=slv&id=247721&dn=","source":{"id":"https://openalex.org/S4377196268","display_name":"Repository of the University of Ljubljana (University of Ljubljana)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I153976015","host_organization_name":"University of Ljubljana","host_organization_lineage":["https://openalex.org/I153976015"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":null,"raw_type":"info:eu-repo/semantics/bachelorThesis"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7213686142.pdf","grobid_xml":"https://content.openalex.org/works/W7213686142.grobid-xml"},"referenced_works_count":4,"referenced_works":["https://openalex.org/W1969483458","https://openalex.org/W2084224084","https://openalex.org/W2134634502","https://openalex.org/W3201661264"],"related_works":["https://openalex.org/W7071565221","https://openalex.org/W7062217790","https://openalex.org/W2216976466","https://openalex.org/W2782820104","https://openalex.org/W7051817699","https://openalex.org/W7164801029","https://openalex.org/W7067908233","https://openalex.org/W2891249382","https://openalex.org/W7103331150","https://openalex.org/W7038379169"],"abstract_inverted_index":{"Iskanje":[0],"najkraj\u0161e":[1,31],"poti":[2],"v":[3,10],"enostavnem":[4],"povezanem":[5],"grafu":[6],"je":[7],"pomemben":[8],"problem":[9],"teoriji":[11],"grafov":[12],"in":[13,22,41,53,69],"ra\u010dunalni\u0161tvu":[14],"s":[15],"\u0161tevilnimi":[16],"aplikacijami,":[17],"kot":[18,36,49],"so":[19],"navigacija,":[20],"omre\u017eja":[21],"optimizacija":[23],"poti.":[24],"Diplomsko":[25],"delo":[26],"predstavi":[27,72],"razli\u010dne":[28],"strategije":[29],"iskanja":[30],"poti,":[32,45],"od":[33],"intuitivnih":[34],"metod,":[35],"sta":[37,50],"lokalno":[38],"po\u017ere\u0161na":[39],"metoda":[40],"pregled":[42],"vseh":[43],"mo\u017enih":[44],"do":[46],"prilagojenih":[47],"algoritmov,":[48],"Dijkstrov":[51],"algoritem":[52],"A*.":[54],"Obravnava":[55],"podatkovne":[56],"strukture,":[57],"ki":[58],"jih":[59],"algoritmi":[60],"uporabljajo":[61],"za":[62],"u\u010dinkovito":[63],"delovanje,":[64],"ter":[65],"ovrednoti":[66],"njihovo":[67],"u\u010dinkovitost":[68],"uspe\u0161nost.":[70],"Sproti":[71],"delovanje":[73],"razli\u010dnih":[74],"metod":[75],"na":[76],"konkretnem":[77],"primeru":[78],"grafa.":[79]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W7213686142","counts_by_year":[],"updated_date":"2026-11-17T12:49:18.490984","created_date":"2026-09-20T00:00:00"}
