An efficient method of computing a minimum spanning tree for a large complete graph

An efficient method of computing a minimum spanning tree for a large complete graph

datePublished

• 1979

description

• kuvitettu
• Sarjan nimi julkaisussa: Report / TKK-F-A.

identifier

• propertyID: FI-FENNI value: 101788
• propertyID: FI-MELINDA value: 003844134
• propertyID: skl value: fx101788

isbn

• 9517517645

isPartOf

• Fennica
• Work. pap. - Popul. Res. Inst., E

name

• An efficient method of computing a minimum spanning tree for a large complete graph

numberOfPages

• [2], 18, [4] s.

P60048

• <http://rdaregistry.info/termList/RDACarrierType/1049>

P60050

• <http://rdaregistry.info/termList/RDAMediaType/1007>

publication

• location: Otaniemi organizer: Teknillinen korkeakoulu

publisher

• Teknillinen korkeakoulu