{"id":"https://openalex.org/W1984673198","doi":"https://doi.org/10.1080/00207169808804754","title":"Optimally fast shortest path algorithms for some classes of graphs","display_name":"Optimally fast shortest path algorithms for some classes of graphs","publication_year":1998,"publication_date":"1998-01-01","ids":{"openalex":"https://openalex.org/W1984673198","doi":"https://doi.org/10.1080/00207169808804754","mag":"1984673198"},"language":"en","primary_location":{"id":"doi:10.1080/00207169808804754","is_oa":false,"landing_page_url":"https://doi.org/10.1080/00207169808804754","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/A5011549805","display_name":"Etsuro Moriya","orcid":null},"institutions":[{"id":"https://openalex.org/I150744194","display_name":"Waseda University","ror":"https://ror.org/00ntfnx83","country_code":"JP","type":"education","lineage":["https://openalex.org/I150744194"]}],"countries":["JP"],"is_corresponding":true,"raw_author_name":"Etsuro Moriya","raw_affiliation_strings":["Department of Mathematics, School of Education , Waseda University , Shinjuku-ku, Tokyo, 169-50, Japan"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, School of Education , Waseda University , Shinjuku-ku, Tokyo, 169-50, Japan","institution_ids":["https://openalex.org/I150744194"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5025053696","display_name":"Keiko Tsugane","orcid":null},"institutions":[{"id":"https://openalex.org/I20560788","display_name":"Tokyo Woman's Christian University","ror":"https://ror.org/03mb27p64","country_code":"JP","type":"education","lineage":["https://openalex.org/I20560788"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Keiko Tsugane","raw_affiliation_strings":["Department of Mathematics , Tokyo Woman's Christian University , Zenpukuji, Suginami-ku, Tokyo, 167, Japan","Department of Mathematics, Tokyo Woman's Christian University, Zenpukuji, Suginami-ku, Tokyo 167, Japan"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics , Tokyo Woman's Christian University , Zenpukuji, Suginami-ku, Tokyo, 167, Japan","institution_ids":["https://openalex.org/I20560788"]},{"raw_affiliation_string":"Department of Mathematics, Tokyo Woman's Christian University, Zenpukuji, Suginami-ku, Tokyo 167, Japan","institution_ids":["https://openalex.org/I20560788"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5011549805"],"corresponding_institution_ids":["https://openalex.org/I150744194"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.11548775,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"70","issue":"2","first_page":"297","last_page":"317"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9995999932289124,"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.9995999932289124,"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/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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9975000023841858,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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-problem","display_name":"Shortest path problem","score":0.7611225843429565},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6783450841903687},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5462722778320312},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5219292640686035},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.512435257434845},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.44676366448402405},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.4358794689178467},{"id":"https://openalex.org/keywords/directed-graph","display_name":"Directed graph","score":0.43166303634643555},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4307924211025238},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.42803704738616943},{"id":"https://openalex.org/keywords/longest-path-problem","display_name":"Longest path problem","score":0.4273829460144043},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.37733206152915955},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.35516223311424255},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.32104039192199707}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.7611225843429565},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6783450841903687},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5462722778320312},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5219292640686035},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.512435257434845},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.44676366448402405},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.4358794689178467},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.43166303634643555},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4307924211025238},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.42803704738616943},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.4273829460144043},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.37733206152915955},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.35516223311424255},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.32104039192199707},{"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/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1080/00207169808804754","is_oa":false,"landing_page_url":"https://doi.org/10.1080/00207169808804754","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":9,"referenced_works":["https://openalex.org/W2007572995","https://openalex.org/W2022980325","https://openalex.org/W2092349585","https://openalex.org/W2120424341","https://openalex.org/W2125690626","https://openalex.org/W2169528473","https://openalex.org/W2752885492","https://openalex.org/W2763025185","https://openalex.org/W2796976177"],"related_works":["https://openalex.org/W4382866750","https://openalex.org/W4293167680","https://openalex.org/W2776102956","https://openalex.org/W4387185483","https://openalex.org/W2022506245","https://openalex.org/W2040572217","https://openalex.org/W2388410942","https://openalex.org/W4385965963","https://openalex.org/W2600678155","https://openalex.org/W2018146256"],"abstract_inverted_index":{"Two":[0],"algorithms":[1,67],"for":[2,25,55,71],"shortest":[3,14,47],"path":[4],"problems":[5],"are":[6,68],"presented.":[7],"One":[8],"is":[9,42,87,105],"to":[10,43,58,95,113,121],"find":[11,44,96,114,122],"the":[12,45,59,78,81,92,100,110,126],"all-pairs":[13],"paths":[15,48],"(APSP)":[16],"that":[17,50,80,99],"runs":[18,51],"in":[19,52,77],"O(n":[20,84,129],"2logn":[21],"+":[22],"nm)":[23],"time":[24,54,93,111,128],"n-vertex":[26],"m-edge":[27],"directed":[28],"graphs":[29,56,76],"consisting":[30],"of":[31,75,91,109],"strongly":[32],"connected":[33],"components":[34],"with":[35],"O(logn)":[36],"edges":[37],"among":[38],"them.":[39],"The":[40,116],"other":[41],"single-source":[46],"(SSSP)":[49],"O(n)":[53,103],"reducible":[57],"trivial":[60],"graph":[61],"by":[62],"some":[63,72],"simple":[64],"transformations.":[65],"These":[66],"optimally":[69],"fast":[70],"special":[73],"classes":[74],"sense":[79],"former":[82],"achieves":[83,102],"2)":[85],"which":[86,104],"a":[88,106],"lower":[89,107],"bound":[90,108],"necessary":[94,112],"APSP,":[97,123],"and":[98],"latter":[101,117],"SSSP.":[115],"can":[118],"be":[119],"used":[120],"also":[124],"achieving":[125],"running":[127],"2).":[130]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}