FRINK Linked Data Fragments server
SemOpenAlex
Search SemOpenAlex by triple/quad pattern
subject
predicate
object
graph
Matches in SemOpenAlex for
{ ?s ?p On the Complexity of Finding a Sparse Connected Spanning Subgraph in a non-Uniform Failure Model ?g. }
Showing items 1 to 1 of
1
with
100
items per page.
W4385774088
title
"
On the Complexity of Finding a Sparse Connected Spanning Subgraph in a non-Uniform Failure Model
"
@default
.