A decomposition algorithm for the all-pairs shortest path problem on massively parallel computer architectures
- Author
- HABBAL, M. B1 ; KOUTSOPOULOS, H. N; LERMAN, S. R
[1] GTE Laboratoires Inc., Waltham MA, United States - Conference name
- TRISTAN I Conference (Montreal PQ 1991-06-05)
- Source
Transportation science. 1994, Vol 28, Num 4, pp 292-308 ; ref : 22 ref
- CODEN
- TRSCBJ
- ISSN
- 0041-1655
- Scientific domain
- Transportation
- Publisher
- Institute for Operations Research and the Management Sciences, Linthicum, MD
- Publication country
- United States
- Document type
- Conference Paper
- Language
- English
- Keyword (fr)
- Algorithme Architecture ordinateur Chemin plus court Décomposition Implémentation Optimisation Parallélisme massif Parallélisme Réseau ordinateur Parallel minisummation operation
- Keyword (en)
- Algorithm Computer architecture Shortest path Decomposition Implementation Optimization Massive parallelism Parallelism Computer network
- Keyword (es)
- Algoritmo Arquitectura ordenador Camino más corto Descomposición Ejecución Optimización Paralelismo masivo Paralelismo Red ordenador
- Classification
- Pascal
- 001 Exact sciences and technology / 001D Applied sciences / 001D02 Computer science; control theory; systems / 001D02A Theoretical computing / 001D02A05 Algorithmics. Computability. Computer arithmetics
- Pascal
- 001 Exact sciences and technology / 001D Applied sciences / 001D02 Computer science; control theory; systems / 001D02B Software / 001D02B04 Computer systems and distributed systems. User interface
- Pascal
- 001 Exact sciences and technology / 001D Applied sciences / 001D02 Computer science; control theory; systems / 001D02B Software / 001D02B09 Software engineering
- Discipline
- Computer science : theoretical automation and systems
- Origin
- Inist-CNRS
- Database
- PASCAL
- INIST identifier
- 3413819
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Access to the document
Install on your browser
DOI
10.1287/trsc.28.4.292 
https://dx.doi.org/10.1287/trsc.28.4.292
"O:13:\"PanistOpenUrl\":36:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000idc\";N;s:6:\"\u0000*\u0000fmt\";s:10:\"proceeding\";s:6:\"\u0000*\u0000doi\";s:21:\"10.1287\/trsc.28.4.292\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:110:\"A decomposition algorithm for the all-pairs shortest path problem on massively parallel computer architectures\";s:9:\"\u0000*\u0000jtitle\";s:22:\"Transportation science\";s:9:\"\u0000*\u0000stitle\";s:11:\"Transp. sci\";s:7:\"\u0000*\u0000date\";s:4:\"1994\";s:9:\"\u0000*\u0000volume\";s:2:\"28\";s:8:\"\u0000*\u0000issue\";s:1:\"4\";s:8:\"\u0000*\u0000spage\";s:3:\"292\";s:8:\"\u0000*\u0000epage\";s:3:\"308\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0041-1655\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:6:\"HABBAL\";s:10:\"\u0000*\u0000aufirst\";s:4:\"M. B\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:2:{i:0;s:18:\"KOUTSOPOULOS, H. N\";i:1;s:12:\"LERMAN, S. R\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"TRSCBJ\";s:8:\"\u0000*\u0000genre\";s:10:\"proceeding\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:110:\"A decomposition algorithm for the all-pairs shortest path problem on massively parallel computer architectures\";s:8:\"\u0000*\u0000place\";s:13:\"Linthicum, MD\";s:6:\"\u0000*\u0000pub\";s:61:\"Institute for Operations Research and the Management Sciences\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:0:\"\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
Panist access
"O:12:\"IstexOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:10:\"proceeding\";s:6:\"\u0000*\u0000doi\";s:21:\"10.1287\/trsc.28.4.292\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:110:\"A decomposition algorithm for the all-pairs shortest path problem on massively parallel computer architectures\";s:9:\"\u0000*\u0000jtitle\";s:22:\"Transportation science\";s:9:\"\u0000*\u0000stitle\";s:11:\"Transp. sci\";s:7:\"\u0000*\u0000date\";s:4:\"1994\";s:9:\"\u0000*\u0000volume\";s:2:\"28\";s:8:\"\u0000*\u0000issue\";s:1:\"4\";s:8:\"\u0000*\u0000spage\";s:3:\"292\";s:8:\"\u0000*\u0000epage\";s:3:\"308\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0041-1655\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:6:\"HABBAL\";s:10:\"\u0000*\u0000aufirst\";s:4:\"M. B\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:2:{i:0;s:18:\"KOUTSOPOULOS, H. N\";i:1;s:12:\"LERMAN, S. R\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"TRSCBJ\";s:8:\"\u0000*\u0000genre\";s:10:\"proceeding\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:110:\"A decomposition algorithm for the all-pairs shortest path problem on massively parallel computer architectures\";s:8:\"\u0000*\u0000place\";s:13:\"Linthicum, MD\";s:6:\"\u0000*\u0000pub\";s:61:\"Institute for Operations Research and the Management Sciences\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:0:\"\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
Istex access
"O:16:\"UnpaywallOpenUrl\":35:{s:8:\"\u0000*\u0000email\";s:27:\"assistance-portail@inist.fr\";s:6:\"\u0000*\u0000fmt\";N;s:6:\"\u0000*\u0000doi\";s:21:\"10.1287\/trsc.28.4.292\";s:6:\"\u0000*\u0000pii\";N;s:7:\"\u0000*\u0000pmid\";N;s:9:\"\u0000*\u0000atitle\";N;s:9:\"\u0000*\u0000jtitle\";N;s:9:\"\u0000*\u0000stitle\";N;s:7:\"\u0000*\u0000date\";N;s:9:\"\u0000*\u0000volume\";N;s:8:\"\u0000*\u0000issue\";N;s:8:\"\u0000*\u0000spage\";N;s:8:\"\u0000*\u0000epage\";N;s:8:\"\u0000*\u0000pages\";N;s:7:\"\u0000*\u0000issn\";N;s:8:\"\u0000*\u0000eissn\";N;s:9:\"\u0000*\u0000aulast\";N;s:10:\"\u0000*\u0000aufirst\";N;s:9:\"\u0000*\u0000auinit\";N;s:10:\"\u0000*\u0000auinitm\";N;s:5:\"\u0000*\u0000au\";N;s:9:\"\u0000*\u0000aucorp\";N;s:7:\"\u0000*\u0000isbn\";N;s:8:\"\u0000*\u0000coden\";N;s:8:\"\u0000*\u0000genre\";N;s:7:\"\u0000*\u0000part\";N;s:9:\"\u0000*\u0000btitle\";N;s:8:\"\u0000*\u0000title\";N;s:8:\"\u0000*\u0000place\";N;s:6:\"\u0000*\u0000pub\";N;s:10:\"\u0000*\u0000edition\";N;s:9:\"\u0000*\u0000tpages\";N;s:9:\"\u0000*\u0000series\";N;s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";N;}"
Unpaywall access
"O:16:\"EuropePMCOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:10:\"proceeding\";s:6:\"\u0000*\u0000doi\";s:21:\"10.1287\/trsc.28.4.292\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:110:\"A decomposition algorithm for the all-pairs shortest path problem on massively parallel computer architectures\";s:9:\"\u0000*\u0000jtitle\";s:22:\"Transportation science\";s:9:\"\u0000*\u0000stitle\";s:11:\"Transp. sci\";s:7:\"\u0000*\u0000date\";s:4:\"1994\";s:9:\"\u0000*\u0000volume\";s:2:\"28\";s:8:\"\u0000*\u0000issue\";s:1:\"4\";s:8:\"\u0000*\u0000spage\";s:3:\"292\";s:8:\"\u0000*\u0000epage\";s:3:\"308\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0041-1655\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:6:\"HABBAL\";s:10:\"\u0000*\u0000aufirst\";s:4:\"M. B\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:2:{i:0;s:18:\"KOUTSOPOULOS, H. N\";i:1;s:12:\"LERMAN, S. R\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"TRSCBJ\";s:8:\"\u0000*\u0000genre\";s:10:\"proceeding\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:110:\"A decomposition algorithm for the all-pairs shortest path problem on massively parallel computer architectures\";s:8:\"\u0000*\u0000place\";s:13:\"Linthicum, MD\";s:6:\"\u0000*\u0000pub\";s:61:\"Institute for Operations Research and the Management Sciences\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:0:\"\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
Europe PubMed Central access
"O:12:\"ArXivOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:10:\"proceeding\";s:6:\"\u0000*\u0000doi\";s:21:\"10.1287\/trsc.28.4.292\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:110:\"A decomposition algorithm for the all-pairs shortest path problem on massively parallel computer architectures\";s:9:\"\u0000*\u0000jtitle\";s:22:\"Transportation science\";s:9:\"\u0000*\u0000stitle\";s:11:\"Transp. sci\";s:7:\"\u0000*\u0000date\";s:4:\"1994\";s:9:\"\u0000*\u0000volume\";s:2:\"28\";s:8:\"\u0000*\u0000issue\";s:1:\"4\";s:8:\"\u0000*\u0000spage\";s:3:\"292\";s:8:\"\u0000*\u0000epage\";s:3:\"308\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0041-1655\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:6:\"HABBAL\";s:10:\"\u0000*\u0000aufirst\";s:4:\"M. B\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:2:{i:0;s:18:\"KOUTSOPOULOS, H. N\";i:1;s:12:\"LERMAN, S. R\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"TRSCBJ\";s:8:\"\u0000*\u0000genre\";s:10:\"proceeding\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:110:\"A decomposition algorithm for the all-pairs shortest path problem on massively parallel computer architectures\";s:8:\"\u0000*\u0000place\";s:13:\"Linthicum, MD\";s:6:\"\u0000*\u0000pub\";s:61:\"Institute for Operations Research and the Management Sciences\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:0:\"\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
arXiv access
