Towards shortest path identification on large networks

Selim, Haysam; Zhan, Justin

doi:10.1186/s40537-016-0042-7

Title: Towards shortest path identification on large networks

Authors:: Selim, Haysam; Zhan, Justin

Publication Date:: Mon Jun 13 00:00:00 EDT 2016

Sponsoring Org.:: USDOE

OSTI Identifier:: 1256775

Grant/Contract Number:: 4000144962

Resource Type:: Published Article

Journal Name:: Journal of Big Data

Additional Journal Information:: Journal Name: Journal of Big Data Journal Volume: 3 Journal Issue: 1; Journal ID: ISSN 2196-1115

Publisher:: Springer Science + Business Media

Country of Publication:: Germany

Language:: English

Citation Formats


                    Selim, Haysam, and Zhan, Justin. Towards shortest path identification on large networks.  Germany: N. p., 2016. 
Web.  doi:10.1186/s40537-016-0042-7.

Copy to clipboard


                    Selim, Haysam, & Zhan, Justin. Towards shortest path identification on large networks.  Germany.  https://doi.org/10.1186/s40537-016-0042-7

Copy to clipboard


                    Selim, Haysam, and Zhan, Justin. Mon .  
"Towards shortest path identification on large networks".  Germany.  https://doi.org/10.1186/s40537-016-0042-7.

Copy to clipboard


                    
@article{osti_1256775,

  title        = {Towards shortest path identification on large networks},

  author       = {Selim, Haysam and Zhan, Justin},

  abstractNote = {},

  doi          = {10.1186/s40537-016-0042-7},

  journal      = {Journal of Big Data},

  number       = 1,

  volume       = 3,

  place        = {Germany},

  year         = {Mon Jun 13 00:00:00 EDT 2016},

  month        = {Mon Jun 13 00:00:00 EDT 2016}

}

Copy to clipboard

Journal Article:

Free Publicly Available Full Text

Publisher's Version of Record
https://doi.org/10.1186/s40537-016-0042-7

Other availability

Search WorldCat to find libraries that may hold this journal

Save / Share:

Export Metadata

Save to My Library

Works referenced in this record:

An Algorithm of Shortest Path Based on Dijkstra for Huge Data
conference, August 2009

Fuhao, Zhang; Jiping, Liu
2009 Sixth International Conference on Fuzzy Systems and Knowledge Discovery
DOI: 10.1109/FSKD.2009.848

Algorithm 457: finding all cliques of an undirected graph
journal, September 1973

Bron, Coen; Kerbosch, Joep
Communications of the ACM, Vol. 16, Issue 9
DOI: 10.1145/362342.362367

A Depth-first Algorithm to Reduce Graphs in Linear Time
conference, September 2009

Bartha, Miklos; Kresz, Miklos
2009 11th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)
DOI: 10.1109/SYNASC.2009.48

On computing the global time-optimal motions of robotic manipulators in the presence of obstacles
journal, January 1991

Shiller, Z.; Dubowsky, S.
IEEE Transactions on Robotics and Automation, Vol. 7, Issue 6
DOI: 10.1109/70.105387

Similarity Measures for Categorical Data: A Comparative Evaluation
conference, December 2013

Boriah, Shyam; Chandola, Varun; Kumar, Vipin
Proceedings of the 2008 SIAM International Conference on Data Mining
DOI: 10.1137/1.9781611972788.22

Finding maximal cliques in massive networks
journal, December 2011

Cheng, James; Ke, Yiping; Fu, Ada Wai-Chee
ACM Transactions on Database Systems, Vol. 36, Issue 4
DOI: 10.1145/2043652.2043654

A Partnership Framework for Geospatial Data Preservation in North Carolina
journal, December 2009

Morris, Steve; Tuttle, James; Essic, Jefferson
Library Trends, Vol. 57, Issue 3, p. 516-540
DOI: 10.1353/lib.0.0050

Fast and accurate estimation of shortest paths in large graphs
conference, January 2010

Gubichev, Andrey; Bedathur, Srikanta; Seufert, Stephan
Proceedings of the 19th ACM international conference on Information and knowledge management - CIKM '10
DOI: 10.1145/1871437.1871503

Similar Records in DOE PAGES and OSTI.GOV collections:

Approximately shortest paths in large scale networks: Algorithms and probabilistic analysis

Conference Chou, Yu-Li ; Romeijin, E ; Smith, R

A class of algorithms, Hierarchical Aggregation Algorithms (HAA), for approximately solving shortest paths problems in very large scale networks are proposed which aim at reducing the computational effort. Networks are first aggregated into a set of subnetworks. Higher level imbedded macronetworks are then defined. The shortest paths are approximated by combining exact shortest paths in subnetworks and in higher level networks. We discuss a probabilistic error analysis and the simulation results in Manhattan-type networks. The algorithm is furthermore implemented on a real-world network, southeastern Michigan network. The numerical results from variations of the algorithm will be compared.
Freight Network Modeling System. Volume IV. Shortest-Path Analysis and Display user's guide

Technical Report

The Freight Network Modeling System (FNEM) is a general and flexible modeling system designed to have wide applicability to a variety of freight transportation analyses. The system consists of compatible network data bases, data management software, models of freight transportation, report generators, and graphics output. In many studies, a model as comprehensive as FNEM is not required. The second model, Shortest-Path Analysis and Display (SPAD), is a simpler model that optimizes routings of single shipments. The routing criteria that can be used are numerous - including minimizing cost, minimizing delay, minimizing population exposure (useful when considering shipments of hazardous materials),more »« less
ON THE ACCELERATION OF SHORTEST PATH CALCULATIONS IN TRANSPORTATION NETWORKS

Conference BAKER, ZACHARY K ; GOKHALE, MAYA B

Shortest path algorithms are a key element of many graph problems. They are used in such applications as online direction finding and navigation, as well as modeling of traffic for large scale simulations of major metropolitan areas. As the shortest path algorithms are an execution bottleneck, it is beneficial to move their execution to parallel hardware such as Field-Programmable Gate Arrays (FPGAs). Hardware implementation is accomplished through the use of a small A core replicated on the order of 20 times on an FPGA device. The objective is to maximize the use of on-board random-access memory bandwidth through the usemore »« less
https://doi.org/10.1109/FCCM.2007.46

Full Text Available
Shortest path network interdiction with asymmetric uncertainty

Journal Article Punla‐Green, She'ifa Z. ; Mitchell, John E. ; Gearhart, Jared L. ; ... - Networks

Abstract This paper considers an extension of the shortest path network interdiction problem that incorporates robustness to account for parameter uncertainty. The shortest path interdiction problem is a game of two players with conflicting agendas and capabilities: an evader, who traverses the arcs of a network from a source node to a sink node using a path of shortest length, and an interdictor, who maximizes the length of the evader's shortest path by interdicting arcs on the network. It is usually assumed that the parameters defining the network are known exactly by both players. We consider the situation where themore »« less
https://doi.org/10.1002/net.22208
Distributional properties of stochastic shortest paths on road networks

Conference Cuellar, Leticia ; Pan, Feng ; Saeger, Kevin J
Full Text Available

Similar Records

Title: Towards shortest path identification on large networks

Citation Formats

An Algorithm of Shortest Path Based on Dijkstra for Huge Data conference, August 2009

Algorithm 457: finding all cliques of an undirected graph journal, September 1973

A Depth-first Algorithm to Reduce Graphs in Linear Time conference, September 2009

On computing the global time-optimal motions of robotic manipulators in the presence of obstacles journal, January 1991

Similarity Measures for Categorical Data: A Comparative Evaluation conference, December 2013

Finding maximal cliques in massive networks journal, December 2011

A Partnership Framework for Geospatial Data Preservation in North Carolina journal, December 2009

Fast and accurate estimation of shortest paths in large graphs conference, January 2010

An Algorithm of Shortest Path Based on Dijkstra for Huge Data
conference, August 2009

Algorithm 457: finding all cliques of an undirected graph
journal, September 1973

A Depth-first Algorithm to Reduce Graphs in Linear Time
conference, September 2009

On computing the global time-optimal motions of robotic manipulators in the presence of obstacles
journal, January 1991

Similarity Measures for Categorical Data: A Comparative Evaluation
conference, December 2013

Finding maximal cliques in massive networks
journal, December 2011

A Partnership Framework for Geospatial Data Preservation in North Carolina
journal, December 2009

Fast and accurate estimation of shortest paths in large graphs
conference, January 2010