National Library of Finland
Open Data and Linked Data Service
Search works, persons, organizations and subjects:
Finding the k most vital edges with respect to minimum spanning tree
URI:
http://urn.fi/URN:NBN:fi:bib:me:W00081911700
author
Shen, Hong
inLanguage
en
isPartOf
Fennica
name
Finding the k most vital edges with respect to minimum spanning tree
P60049
<http://rdaregistry.info/termList/RDAContentType/1020>
Instances
1995 : Åbo Akademi
View this in Finna
Finding the k most vital edges with respect to minimum spanning tree
URI:
http://urn.fi/URN:NBN:fi:bib:me:I00081911700
datePublished
1995
identifier
propertyID:
FI-FENNI
value:
462176
propertyID:
FI-MELINDA
value:
000819117
isbn
9516506453
isPartOf
Fennica
Reports on computer science & mathematics / Åbo Akademi. Ser. A
name
Finding the k most vital edges with respect to minimum spanning tree
numberOfPages
15, [2] s.
P60048
<http://rdaregistry.info/termList/RDACarrierType/1049>
P60050
<http://rdaregistry.info/termList/RDAMediaType/1007>
publication
location:
Turku
organizer:
Åbo Akademi
publisher
Åbo Akademi
Download this resource as RDF:
Turtle
RDF/XML
N-Triples
JSON-LD