An adaptive and cost-optimal parallel algorithm for minimum spanning trees
- Author
- AKL, S. G1
[1] Queen univ., dep. computing information sci., Kingston ON, Canada - Source
Computing (Wien. Print). 1986, Vol 36, Num 3, pp 271-277 ; ref : 30 ref
- CODEN
- CMPTA2
- ISSN
- 0010-485X
- Scientific domain
- Computer science; Mathematics
- Publisher
- Springer, Wien
- Publication country
- Austria
- Document type
- Article
- Language
- English
- Keyword (fr)
- Algorithme adaptatif Algorithme optimal Algorithme parallèle Arbre maximal Graphe
- Keyword (en)
- Adaptive algorithm Optimal algorithm Parallel algorithm Spanning tree Graph
- Keyword (es)
- Algoritmo adaptativo Algoritmo óptimo Algoritmo paralelo Arbol máximo Gráfico
- Classification
- Pascal
- 001 Exact sciences and technology / 001D Applied sciences / 001D02 Computer science; control theory; systems / 001D02A Theoretical computing / 001D02A05 Algorithmics. Computability. Computer arithmetics
- Discipline
- Computer science : theoretical automation and systems
- Origin
- Inist-CNRS
- Database
- PASCAL
- INIST identifier
- 7942432
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.1007/BF02240073 
https://dx.doi.org/10.1007/BF02240073
"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:18:\"10.1007\/BF02240073\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:74:\"An adaptive and cost-optimal parallel algorithm for minimum spanning trees\";s:9:\"\u0000*\u0000jtitle\";s:23:\"Computing (Wien. Print)\";s:9:\"\u0000*\u0000stitle\";s:23:\"Computing (Wien. Print)\";s:7:\"\u0000*\u0000date\";s:4:\"1986\";s:9:\"\u0000*\u0000volume\";s:2:\"36\";s:8:\"\u0000*\u0000issue\";s:1:\"3\";s:8:\"\u0000*\u0000spage\";s:3:\"271\";s:8:\"\u0000*\u0000epage\";s:3:\"277\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0010-485X\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:3:\"AKL\";s:10:\"\u0000*\u0000aufirst\";s:4:\"S. G\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:0:{}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"CMPTA2\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:74:\"An adaptive and cost-optimal parallel algorithm for minimum spanning trees\";s:8:\"\u0000*\u0000place\";s:4:\"Wien\";s:6:\"\u0000*\u0000pub\";s:8:\"Springer\";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:7:\"journal\";s:6:\"\u0000*\u0000doi\";s:18:\"10.1007\/BF02240073\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:74:\"An adaptive and cost-optimal parallel algorithm for minimum spanning trees\";s:9:\"\u0000*\u0000jtitle\";s:23:\"Computing (Wien. Print)\";s:9:\"\u0000*\u0000stitle\";s:23:\"Computing (Wien. Print)\";s:7:\"\u0000*\u0000date\";s:4:\"1986\";s:9:\"\u0000*\u0000volume\";s:2:\"36\";s:8:\"\u0000*\u0000issue\";s:1:\"3\";s:8:\"\u0000*\u0000spage\";s:3:\"271\";s:8:\"\u0000*\u0000epage\";s:3:\"277\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0010-485X\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:3:\"AKL\";s:10:\"\u0000*\u0000aufirst\";s:4:\"S. G\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:0:{}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"CMPTA2\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:74:\"An adaptive and cost-optimal parallel algorithm for minimum spanning trees\";s:8:\"\u0000*\u0000place\";s:4:\"Wien\";s:6:\"\u0000*\u0000pub\";s:8:\"Springer\";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:18:\"10.1007\/BF02240073\";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:18:\"10.1007\/BF02240073\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:74:\"An adaptive and cost-optimal parallel algorithm for minimum spanning trees\";s:9:\"\u0000*\u0000jtitle\";s:23:\"Computing (Wien. Print)\";s:9:\"\u0000*\u0000stitle\";s:23:\"Computing (Wien. Print)\";s:7:\"\u0000*\u0000date\";s:4:\"1986\";s:9:\"\u0000*\u0000volume\";s:2:\"36\";s:8:\"\u0000*\u0000issue\";s:1:\"3\";s:8:\"\u0000*\u0000spage\";s:3:\"271\";s:8:\"\u0000*\u0000epage\";s:3:\"277\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0010-485X\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:3:\"AKL\";s:10:\"\u0000*\u0000aufirst\";s:4:\"S. G\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:0:{}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"CMPTA2\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:74:\"An adaptive and cost-optimal parallel algorithm for minimum spanning trees\";s:8:\"\u0000*\u0000place\";s:4:\"Wien\";s:6:\"\u0000*\u0000pub\";s:8:\"Springer\";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:11:\"BaseOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:7:\"journal\";s:6:\"\u0000*\u0000doi\";s:18:\"10.1007\/BF02240073\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:74:\"An adaptive and cost-optimal parallel algorithm for minimum spanning trees\";s:9:\"\u0000*\u0000jtitle\";s:23:\"Computing (Wien. Print)\";s:9:\"\u0000*\u0000stitle\";s:23:\"Computing (Wien. Print)\";s:7:\"\u0000*\u0000date\";s:4:\"1986\";s:9:\"\u0000*\u0000volume\";s:2:\"36\";s:8:\"\u0000*\u0000issue\";s:1:\"3\";s:8:\"\u0000*\u0000spage\";s:3:\"271\";s:8:\"\u0000*\u0000epage\";s:3:\"277\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0010-485X\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:3:\"AKL\";s:10:\"\u0000*\u0000aufirst\";s:4:\"S. G\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:0:{}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"CMPTA2\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:74:\"An adaptive and cost-optimal parallel algorithm for minimum spanning trees\";s:8:\"\u0000*\u0000place\";s:4:\"Wien\";s:6:\"\u0000*\u0000pub\";s:8:\"Springer\";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;}"
Base Search access
"O:12:\"ArXivOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:7:\"journal\";s:6:\"\u0000*\u0000doi\";s:18:\"10.1007\/BF02240073\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:74:\"An adaptive and cost-optimal parallel algorithm for minimum spanning trees\";s:9:\"\u0000*\u0000jtitle\";s:23:\"Computing (Wien. Print)\";s:9:\"\u0000*\u0000stitle\";s:23:\"Computing (Wien. Print)\";s:7:\"\u0000*\u0000date\";s:4:\"1986\";s:9:\"\u0000*\u0000volume\";s:2:\"36\";s:8:\"\u0000*\u0000issue\";s:1:\"3\";s:8:\"\u0000*\u0000spage\";s:3:\"271\";s:8:\"\u0000*\u0000epage\";s:3:\"277\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0010-485X\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:3:\"AKL\";s:10:\"\u0000*\u0000aufirst\";s:4:\"S. G\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:0:{}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"CMPTA2\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:74:\"An adaptive and cost-optimal parallel algorithm for minimum spanning trees\";s:8:\"\u0000*\u0000place\";s:4:\"Wien\";s:6:\"\u0000*\u0000pub\";s:8:\"Springer\";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
