FRINK Linked Data Fragments server
SemOpenAlex
Search SemOpenAlex by triple/quad pattern
subject
predicate
object
graph
Matches in SemOpenAlex for
{ ?s ?p An O(n log n) Average Time Algorithm for Computing the Shortest Network under a Given Topology ?g. }
Showing items 1 to 1 of
1
with
100
items per page.
W2000368618
title
"
An O(n log n) Average Time Algorithm for Computing the Shortest Network under a Given Topology
"
@default
.
