Matches in Wikidata for { <http://www.wikidata.org/entity/Q57427186> ?p ?o ?g. }
Showing items 1 to 34 of
34
with 100 items per page.
- Q57427186 description "im Mai 2013 veröffentlichter wissenschaftlicher Artikel" @default.
- Q57427186 description "scholarly article by Anu Pradhan & G. (Kumar) Mahinthakumar published May 2013 in Journal of Computing in Civil Engineering" @default.
- Q57427186 description "wetenschappelijk artikel" @default.
- Q57427186 description "наукова стаття, опублікована в травні 2013" @default.
- Q57427186 name "Finding All-Pairs Shortest Path for a Large-Scale Transportation Network Using Parallel Floyd-Warshall and Parallel Dijkstra Algorithms" @default.
- Q57427186 name "Finding All-Pairs Shortest Path for a Large-Scale Transportation Network Using Parallel Floyd-Warshall and Parallel Dijkstra Algorithms" @default.
- Q57427186 type Item @default.
- Q57427186 label "Finding All-Pairs Shortest Path for a Large-Scale Transportation Network Using Parallel Floyd-Warshall and Parallel Dijkstra Algorithms" @default.
- Q57427186 label "Finding All-Pairs Shortest Path for a Large-Scale Transportation Network Using Parallel Floyd-Warshall and Parallel Dijkstra Algorithms" @default.
- Q57427186 prefLabel "Finding All-Pairs Shortest Path for a Large-Scale Transportation Network Using Parallel Floyd-Warshall and Parallel Dijkstra Algorithms" @default.
- Q57427186 prefLabel "Finding All-Pairs Shortest Path for a Large-Scale Transportation Network Using Parallel Floyd-Warshall and Parallel Dijkstra Algorithms" @default.
- Q57427186 P1433 Q57427186-1D4A2041-9372-496A-ADAB-740E66BDF81A @default.
- Q57427186 P1476 Q57427186-8B21535E-C83D-43D7-AB54-539794DF75F4 @default.
- Q57427186 P2093 Q57427186-3EAE8951-85AD-4990-91AF-EB2AB673B510 @default.
- Q57427186 P2093 Q57427186-69AA6938-8922-48CE-986B-69022D9A2B47 @default.
- Q57427186 P304 Q57427186-E5DDB416-DBDB-4CF6-94CE-D61F3F9A9923 @default.
- Q57427186 P31 Q57427186-739064A1-C69E-4AC5-8891-BB39A2703F07 @default.
- Q57427186 P356 Q57427186-AC6C6C74-1688-4040-81E7-46F2F4E1CE47 @default.
- Q57427186 P433 Q57427186-5CC681BE-76E1-4948-9CDB-278532E0C06F @default.
- Q57427186 P478 Q57427186-F3451FD4-4CD4-4486-811D-C55FCBA61FD5 @default.
- Q57427186 P577 Q57427186-19C98753-5A50-48A0-8A00-685DEEA41437 @default.
- Q57427186 P921 Q57427186-223E1AE6-D744-4B17-ADE9-E7E2C87258F9 @default.
- Q57427186 P356 (ASCE)CP.1943-5487.0000220 @default.
- Q57427186 P1433 Q15760344 @default.
- Q57427186 P1476 "Finding All-Pairs Shortest Path for a Large-Scale Transportation Network Using Parallel Floyd-Warshall and Parallel Dijkstra Algorithms" @default.
- Q57427186 P2093 "Anu Pradhan" @default.
- Q57427186 P2093 "G. (Kumar) Mahinthakumar" @default.
- Q57427186 P304 "263-273" @default.
- Q57427186 P31 Q13442814 @default.
- Q57427186 P356 "10.1061/(ASCE)CP.1943-5487.0000220" @default.
- Q57427186 P433 "3" @default.
- Q57427186 P478 "27" @default.
- Q57427186 P577 "2013-05-01T00:00:00Z" @default.
- Q57427186 P921 Q8366 @default.