FRINK Linked Data Fragments server
SemOpenAlex
Search SemOpenAlex by triple/quad pattern
subject
predicate
object
graph
Matches in SemOpenAlex for
{ ?s ?p Computing a Minimum-Dilation Spanning Tree is NP-hard ?g. }
Showing items 1 to 1 of
1
with
100
items per page.
W2951330763
title
"
Computing a Minimum-Dilation Spanning Tree is NP-hard
"
@default
.
