Published 1977
| Version v1
Report
Open
Determination of minimal spanning trees for total graphs
Description
Two equivalent programs are presented for the BESM-6 and CDC-6500 computers that construct minimal spanning trees for total graphs of an order of (<=) 100. The executive time increases slowly with increasing order of graphs
Availability note (English)
MF available from INIS under the Report Number.Files
9376859.pdf
Files
(190.2 kB)
| Name | Size | Download all |
|---|---|---|
|
md5:24d07635d46abed5cbc4feb168802244
|
190.2 kB | Preview Download |
System files
(21.4 kB)
| Name | Size | Download all |
|---|
Additional details
Additional titles
- Original title (Russian)
- Нахождение кратчайших связывающих деревьев в полных графах
Publishing Information
- Imprint Pagination
- 9 p.
- Report number
- JINR-R--11-10634
INIS
- Country of Publication
- USSR
- Country of Input or Organization
- USSR
- INIS RN
- 9376859
- Subject category
- S99: GENERAL AND MISCELLANEOUS;
- Descriptors DEI
- ALGORITHMS; BESM COMPUTERS; CDC COMPUTERS; COMPUTER CODES; FORTRAN; PRINTED CIRCUITS
- Descriptors DEC
- COMPUTERS; ELECTRONIC CIRCUITS; PROGRAMMING LANGUAGES
Optional Information
- Notes
- 3 refs.; 2 figs.; 1 table.