DBpedia – Linked Data Fragments
DBpedia 2015-10
Query DBpedia 2015-10 by triple pattern
subject
predicate
object
Matches in DBpedia 2015-10 for
{ ?s ?p "Computing tree-depth faster than 2n" }
Showing triples 1 to 1 of
1
with
100
triples per page.
978-3-319-03898-8_13
contribution
"
Computing tree-depth faster than 2n
"
.
