Matches in DBpedia 2016-04 for { <http://citation.dbpedia.org/hash/15b1e044c8aefca43fc9c6d444a1ebf805b09a61467982a76e416228ac8feab9> ?p ?o }
Showing triples 1 to 10 of
10
with 100 triples per page.
- 15b1e044c8aefca43fc9c6d444a1ebf805b09a61467982a76e416228ac8feab9 first "Jin Y.".
- 15b1e044c8aefca43fc9c6d444a1ebf805b09a61467982a76e416228ac8feab9 isCitedBy Bellman–Ford_algorithm.
- 15b1e044c8aefca43fc9c6d444a1ebf805b09a61467982a76e416228ac8feab9 journal "Quarterly of Applied Mathematics".
- 15b1e044c8aefca43fc9c6d444a1ebf805b09a61467982a76e416228ac8feab9 last "Yen".
- 15b1e044c8aefca43fc9c6d444a1ebf805b09a61467982a76e416228ac8feab9 mr "0253822".
- 15b1e044c8aefca43fc9c6d444a1ebf805b09a61467982a76e416228ac8feab9 pages "526–530".
- 15b1e044c8aefca43fc9c6d444a1ebf805b09a61467982a76e416228ac8feab9 ref "harv".
- 15b1e044c8aefca43fc9c6d444a1ebf805b09a61467982a76e416228ac8feab9 title "An algorithm for finding shortest routes from all source nodes to a given destination in general networks".
- 15b1e044c8aefca43fc9c6d444a1ebf805b09a61467982a76e416228ac8feab9 volume "27".
- 15b1e044c8aefca43fc9c6d444a1ebf805b09a61467982a76e416228ac8feab9 year "1970".