DBpedia – Linked Data Fragments
DBpedia 2016-04
Query DBpedia 2016-04 by triple pattern
subject
predicate
object
Matches in DBpedia 2016-04 for
{ ?s ?p "Computing Geometric Minimum-Dilation Graphs is NP-Hard" }
Showing triples 1 to 1 of
1
with
100
triples per page.
978-3-540-70904-6
contribution
"
Computing Geometric Minimum-Dilation Graphs is NP-Hard
"
.
