FRINK Linked Data Fragments server
SemOpenAlex
Search SemOpenAlex by triple/quad pattern
subject
predicate
object
graph
Matches in SemOpenAlex for
{ ?s ?p A nonenumerative algorithm to find the k longest (shortest) paths in a DAG ?g. }
Showing items 1 to 1 of
1
with
100
items per page.
W1539737574
title
"
A nonenumerative algorithm to find the k longest (shortest) paths in a DAG
"
@default
.
