FRINK Linked Data Fragments server
SemOpenAlex
Search SemOpenAlex by triple/quad pattern
subject
predicate
object
graph
Matches in SemOpenAlex for
{ ?s ?p One Sided Crossing Minimization Is NP-Hard for Sparse Graphs ?g. }
Showing items 1 to 1 of
1
with
100
items per page.
W1505320659
title
"
One Sided Crossing Minimization Is NP-Hard for Sparse Graphs
"
@default
.
