FRINK Linked Data Fragments server
SemOpenAlex
Search SemOpenAlex by triple/quad pattern
subject
predicate
object
graph
Matches in SemOpenAlex for
{ ?s ?p Nearly Optimal Communication and Query Complexity of Bipartite Matching ?g. }
Showing items 1 to 2 of
2
with
100
items per page.
W4313228059
title
"
Nearly Optimal Communication and Query Complexity of Bipartite Matching
"
@default
.
W4290058549
title
"
Nearly Optimal Communication and Query Complexity of Bipartite Matching
"
@default
.
