{"id":"https://openalex.org/W1520287896","doi":"https://doi.org/10.1109/icnc.2010.5583353","title":"An improved algorithm for vertex sequence of shortest path","display_name":"An improved algorithm for vertex sequence of shortest path","publication_year":2010,"publication_date":"2010-08-01","ids":{"openalex":"https://openalex.org/W1520287896","doi":"https://doi.org/10.1109/icnc.2010.5583353","mag":"1520287896"},"language":"en","primary_location":{"id":"doi:10.1109/icnc.2010.5583353","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icnc.2010.5583353","pdf_url":null,"source":{"id":"https://openalex.org/S4363608012","display_name":"2010 Sixth International Conference on Natural Computation","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 Sixth International Conference on Natural Computation","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/A5070581638","display_name":"Fu Baiwen","orcid":null},"institutions":[{"id":"https://openalex.org/I114234892","display_name":"Beijing Union University","ror":"https://ror.org/01hg31662","country_code":"CN","type":"education","lineage":["https://openalex.org/I114234892"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Bai-wen Fu","raw_affiliation_strings":["Department of Software Engineering, BUU, Beijing, China","Department of Software Engineering, Information College, Beijing Union University, Beijing, China"],"affiliations":[{"raw_affiliation_string":"Department of Software Engineering, BUU, Beijing, China","institution_ids":[]},{"raw_affiliation_string":"Department of Software Engineering, Information College, Beijing Union University, Beijing, China","institution_ids":["https://openalex.org/I114234892"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5070581638"],"corresponding_institution_ids":["https://openalex.org/I114234892"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.05643739,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"24","issue":null,"first_page":"112","last_page":"116"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12326","display_name":"Network Packet Processing and Optimization","score":0.9950000047683716,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/T12326","display_name":"Network Packet Processing and Optimization","score":0.9950000047683716,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9929999709129333,"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.9929999709129333,"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/shortest-path-faster-algorithm","display_name":"Shortest Path Faster Algorithm","score":0.7946543097496033},{"id":"https://openalex.org/keywords/yens-algorithm","display_name":"Yen's algorithm","score":0.7943190336227417},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.7523424625396729},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.7507041692733765},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6415228247642517},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6135056614875793},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5425369143486023},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.5209782719612122},{"id":"https://openalex.org/keywords/efficient-algorithm","display_name":"Efficient algorithm","score":0.4525175094604492},{"id":"https://openalex.org/keywords/floyd\u2013warshall-algorithm","display_name":"Floyd\u2013Warshall algorithm","score":0.44719576835632324},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4289565086364746},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3787440359592438},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2699260115623474},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.26977813243865967},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.16510048508644104}],"concepts":[{"id":"https://openalex.org/C168451585","wikidata":"https://www.wikidata.org/wiki/Q7502159","display_name":"Shortest Path Faster Algorithm","level":5,"score":0.7946543097496033},{"id":"https://openalex.org/C119971455","wikidata":"https://www.wikidata.org/wiki/Q8052172","display_name":"Yen's algorithm","level":5,"score":0.7943190336227417},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.7523424625396729},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.7507041692733765},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6415228247642517},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6135056614875793},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5425369143486023},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.5209782719612122},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.4525175094604492},{"id":"https://openalex.org/C186065694","wikidata":"https://www.wikidata.org/wiki/Q1047576","display_name":"Floyd\u2013Warshall algorithm","level":5,"score":0.44719576835632324},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4289565086364746},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3787440359592438},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2699260115623474},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.26977813243865967},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.16510048508644104},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icnc.2010.5583353","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icnc.2010.5583353","pdf_url":null,"source":{"id":"https://openalex.org/S4363608012","display_name":"2010 Sixth International Conference on Natural Computation","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 Sixth International Conference on Natural Computation","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Affordable and clean energy","id":"https://metadata.un.org/sdg/7","score":0.7300000190734863}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":5,"referenced_works":["https://openalex.org/W2354420214","https://openalex.org/W2374861956","https://openalex.org/W2376750602","https://openalex.org/W2762935521","https://openalex.org/W6709572512"],"related_works":["https://openalex.org/W651485002","https://openalex.org/W2360981904","https://openalex.org/W2597144308","https://openalex.org/W4293054712","https://openalex.org/W2391130892","https://openalex.org/W2358661218","https://openalex.org/W2347245430","https://openalex.org/W1617152041","https://openalex.org/W2381419702","https://openalex.org/W2368964068"],"abstract_inverted_index":{"It's":[0],"important":[1],"to":[2],"evaluate":[3],"the":[4,35,48,52,62,65],"shortest":[5,21],"paths":[6],"in":[7,23],"many":[8],"fields.":[9],"Based":[10],"on":[11,47],"one-dimension":[12],"arrays":[13],"an":[14],"improved":[15,46],"algorithm":[16,36,53],"for":[17,33,60],"vertex":[18],"sequence":[19],"of":[20,39,64],"path":[22],"undirected":[24],"networks":[25],"is":[26,31,54],"given.":[27],"An":[28],"illumination":[29],"rule":[30],"presented":[32],"improving":[34],"efficiency.":[37],"Both":[38],"time":[40],"and":[41],"space":[42],"efficiency":[43,63],"can":[44],"be":[45],"rule.":[49],"Analysis":[50],"about":[51],"presented.":[55],"Experiments":[56],"have":[57],"been":[58],"done":[59],"showing":[61],"algorithm.":[66]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}