National Library of Finland
Open Data and Linked Data Service
Search works, persons, organizations and subjects:
An efficient method of computing a minimum spanning tree for a large complete graph
URI:
http://urn.fi/URN:NBN:fi:bib:me:W00384413400
author
Kortekangas, Atte
contributor
Oja, Erkki
Teknillinen korkeakoulu. Teknillisen fysiikan osasto
inLanguage
en
isPartOf
Fennica
name
An efficient method of computing a minimum spanning tree for a large complete graph
P60049
<http://rdaregistry.info/termList/RDAContentType/1020>
Instances
1979 : Teknillinen korkeakoulu
View this in Finna
An efficient method of computing a minimum spanning tree for a large complete graph
URI:
http://urn.fi/URN:NBN:fi:bib:me:I00384413400
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
Vesitekniikan laboratorion julkaisuja / Oulun yliopisto. Sarja B
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
Download this resource as RDF:
Turtle
RDF/XML
N-Triples
JSON-LD