National Library of Finland
Open Data and Linked Data Service
Search works, persons, organizations and subjects:
Fast parallel algorithm for finding the kth longest path in a tree
URI:
http://urn.fi/URN:NBN:fi:bib:me:W00082779200
author
Shen, Hong
inLanguage
en
isPartOf
Fennica
name
Fast parallel algorithm for finding the kth longest path in a tree
P60049
<http://rdaregistry.info/termList/RDAContentType/1020>
Instances
1995 : Åbo Akademi
View this in Finna
Fast parallel algorithm for finding the kth longest path in a tree
URI:
http://urn.fi/URN:NBN:fi:bib:me:I00082779200
datePublished
1995
identifier
propertyID:
FI-FENNI
value:
479772
propertyID:
FI-MELINDA
value:
000827792
isbn
9516506763
isPartOf
Fennica
Rapporter från Åbo akademi. Informationsbehandling & matematik. Ser. A
name
Fast parallel algorithm for finding the kth longest path in a tree
numberOfPages
9, [2] s.
P60048
<http://rdaregistry.info/termList/RDACarrierType/1049>
P60050
<http://rdaregistry.info/termList/RDAMediaType/1007>
publication
location:
Åbo
organizer:
Åbo Akademi
publisher
Åbo Akademi
Download this resource as RDF:
Turtle
RDF/XML
N-Triples
JSON-LD