Fast shared-memory algorithms for computing the minimum spanning forest of sparse graphs
- Author
- BADER, David A1 ; GUOJING CONG2
[1] College of Computing, Georgia Institute of Technology, Atlanta, GA 30332, United States
[2] IBM T.J. Watson Research Center, Yorktown Heights, NY 10598, United States - Source
Journal of parallel and distributed computing (Print). 2006, Vol 66, Num 11, pp 1366-1378, 13 p ; ref : 38 ref
- ISSN
- 0743-7315
- Scientific domain
- Computer science; Mathematics
- Publisher
- Elsevier, San Diego, CA
- Publication country
- United States
- Document type
- Article
- Language
- English
- Author keyword
- Connectivity High-performance algorithm engineering Parallel graph algorithms
- Keyword (fr)
- Algorithme parallèle Algorithme rapide Application médicale Arme biologique Biologie Bioterrorisme Calcul réparti Cancérologie Conception circuit Entreprise Forêt graphe Graphe aléatoire Graphe régulier Homme Imagerie médicale Multiprocesseur Mémoire partagée Optimisation combinatoire Problème combinatoire Réseau communication Site Web Structure périodique Système réparti Terrorisme Tumeur maligne Arbre recouvrant minimal Graphe épars Réseau sans fil
- Keyword (en)
- Parallel algorithm Fast algorithm Medical application Biological warfare Biology Bioterrorism Distributed computing Cancerology Circuit design Firm Forest(graph) Random graph Regular graph Human Medical imagery Multiprocessor Shared memory Combinatorial optimization Combinatorial problem Communication network Web site Periodic structure Distributed system Terrorism Malignant tumor Minimum spanning tree MST Sparse graph Wireless network
- Keyword (es)
- Algoritmo paralelo Algoritmo rápido Aplicación medical Arma biológica Biología Bioterrorismo Cálculo repartido Cancerología Diseño circuito Empresa Bosque grafo Grafo aleatorio Grafo regular Hombre Imaginería médica Multiprocesador Memoria compartida Optimización combinatoria Problema combinatorio Red de comunicación Sitio Web Estructura periódica Sistema repartido Terrorismo Tumor maligno Arbol MST Grafo disperso Red sin hilo
- Classification
- 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
- Discipline
- Computer science : theoretical automation and systems
- Origin
- Inist-CNRS
- Database
- PASCAL
- INIST identifier
- 18256470
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.1016/j.jpdc.2006.06.001 
https://dx.doi.org/10.1016/j.jpdc.2006.06.001
"O:13:\"PanistOpenUrl\":36:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000idc\";N;s:6:\"\u0000*\u0000fmt\";s:7:\"journal\";s:6:\"\u0000*\u0000doi\";s:26:\"10.1016\/j.jpdc.2006.06.001\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:88:\"Fast shared-memory algorithms for computing the minimum spanning forest of sparse graphs\";s:9:\"\u0000*\u0000jtitle\";s:53:\"Journal of parallel and distributed computing (Print)\";s:9:\"\u0000*\u0000stitle\";s:36:\"J. parallel distrib. comput. (Print)\";s:7:\"\u0000*\u0000date\";s:4:\"2006\";s:9:\"\u0000*\u0000volume\";s:2:\"66\";s:8:\"\u0000*\u0000issue\";s:2:\"11\";s:8:\"\u0000*\u0000spage\";s:4:\"1366\";s:8:\"\u0000*\u0000epage\";s:4:\"1378\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0743-7315\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:5:\"BADER\";s:10:\"\u0000*\u0000aufirst\";s:7:\"David A\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:1:{i:0;s:12:\"GUOJING CONG\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:0:\"\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:88:\"Fast shared-memory algorithms for computing the minimum spanning forest of sparse graphs\";s:8:\"\u0000*\u0000place\";s:13:\"San Diego, CA\";s:6:\"\u0000*\u0000pub\";s:8:\"Elsevier\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:2:\"13\";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:7:\"journal\";s:6:\"\u0000*\u0000doi\";s:26:\"10.1016\/j.jpdc.2006.06.001\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:88:\"Fast shared-memory algorithms for computing the minimum spanning forest of sparse graphs\";s:9:\"\u0000*\u0000jtitle\";s:53:\"Journal of parallel and distributed computing (Print)\";s:9:\"\u0000*\u0000stitle\";s:36:\"J. parallel distrib. comput. (Print)\";s:7:\"\u0000*\u0000date\";s:4:\"2006\";s:9:\"\u0000*\u0000volume\";s:2:\"66\";s:8:\"\u0000*\u0000issue\";s:2:\"11\";s:8:\"\u0000*\u0000spage\";s:4:\"1366\";s:8:\"\u0000*\u0000epage\";s:4:\"1378\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0743-7315\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:5:\"BADER\";s:10:\"\u0000*\u0000aufirst\";s:7:\"David A\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:1:{i:0;s:12:\"GUOJING CONG\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:0:\"\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:88:\"Fast shared-memory algorithms for computing the minimum spanning forest of sparse graphs\";s:8:\"\u0000*\u0000place\";s:13:\"San Diego, CA\";s:6:\"\u0000*\u0000pub\";s:8:\"Elsevier\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:2:\"13\";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:26:\"10.1016\/j.jpdc.2006.06.001\";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:7:\"journal\";s:6:\"\u0000*\u0000doi\";s:26:\"10.1016\/j.jpdc.2006.06.001\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:88:\"Fast shared-memory algorithms for computing the minimum spanning forest of sparse graphs\";s:9:\"\u0000*\u0000jtitle\";s:53:\"Journal of parallel and distributed computing (Print)\";s:9:\"\u0000*\u0000stitle\";s:36:\"J. parallel distrib. comput. (Print)\";s:7:\"\u0000*\u0000date\";s:4:\"2006\";s:9:\"\u0000*\u0000volume\";s:2:\"66\";s:8:\"\u0000*\u0000issue\";s:2:\"11\";s:8:\"\u0000*\u0000spage\";s:4:\"1366\";s:8:\"\u0000*\u0000epage\";s:4:\"1378\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0743-7315\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:5:\"BADER\";s:10:\"\u0000*\u0000aufirst\";s:7:\"David A\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:1:{i:0;s:12:\"GUOJING CONG\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:0:\"\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:88:\"Fast shared-memory algorithms for computing the minimum spanning forest of sparse graphs\";s:8:\"\u0000*\u0000place\";s:13:\"San Diego, CA\";s:6:\"\u0000*\u0000pub\";s:8:\"Elsevier\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:2:\"13\";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:11:\"BaseOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:7:\"journal\";s:6:\"\u0000*\u0000doi\";s:26:\"10.1016\/j.jpdc.2006.06.001\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:88:\"Fast shared-memory algorithms for computing the minimum spanning forest of sparse graphs\";s:9:\"\u0000*\u0000jtitle\";s:53:\"Journal of parallel and distributed computing (Print)\";s:9:\"\u0000*\u0000stitle\";s:36:\"J. parallel distrib. comput. (Print)\";s:7:\"\u0000*\u0000date\";s:4:\"2006\";s:9:\"\u0000*\u0000volume\";s:2:\"66\";s:8:\"\u0000*\u0000issue\";s:2:\"11\";s:8:\"\u0000*\u0000spage\";s:4:\"1366\";s:8:\"\u0000*\u0000epage\";s:4:\"1378\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0743-7315\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:5:\"BADER\";s:10:\"\u0000*\u0000aufirst\";s:7:\"David A\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:1:{i:0;s:12:\"GUOJING CONG\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:0:\"\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:88:\"Fast shared-memory algorithms for computing the minimum spanning forest of sparse graphs\";s:8:\"\u0000*\u0000place\";s:13:\"San Diego, CA\";s:6:\"\u0000*\u0000pub\";s:8:\"Elsevier\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:2:\"13\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
Base Search access
"O:12:\"ArXivOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:7:\"journal\";s:6:\"\u0000*\u0000doi\";s:26:\"10.1016\/j.jpdc.2006.06.001\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:88:\"Fast shared-memory algorithms for computing the minimum spanning forest of sparse graphs\";s:9:\"\u0000*\u0000jtitle\";s:53:\"Journal of parallel and distributed computing (Print)\";s:9:\"\u0000*\u0000stitle\";s:36:\"J. parallel distrib. comput. (Print)\";s:7:\"\u0000*\u0000date\";s:4:\"2006\";s:9:\"\u0000*\u0000volume\";s:2:\"66\";s:8:\"\u0000*\u0000issue\";s:2:\"11\";s:8:\"\u0000*\u0000spage\";s:4:\"1366\";s:8:\"\u0000*\u0000epage\";s:4:\"1378\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0743-7315\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:5:\"BADER\";s:10:\"\u0000*\u0000aufirst\";s:7:\"David A\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:1:{i:0;s:12:\"GUOJING CONG\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:0:\"\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:88:\"Fast shared-memory algorithms for computing the minimum spanning forest of sparse graphs\";s:8:\"\u0000*\u0000place\";s:13:\"San Diego, CA\";s:6:\"\u0000*\u0000pub\";s:8:\"Elsevier\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:2:\"13\";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
