An O(/E/loglog/V/) algorithm for finding minimum spanning trees /
| Data(s) |
07/11/1974
|
|---|---|
| Resumo |
Includes bibliographical references. Mode of access: Internet. |
| Formato |
con |
| Identificador | |
| Idioma(s) |
eng |
| Publicador |
Urbana, Illinois : Dept. of Computer Science, University of Illinois at Urbana-Champaign, |
| Direitos |
Items in this record are available as Creative Commons Attribution-NonCommercial-ShareAlike. View access and use profile at http://www.hathitrust.org/access_use#cc-by-nc-sa-3.0. Please see individual items for rights and use statements. |
| Palavras-Chave | #Trees (Graph theory) |
| Tipo |
text |
