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 "The complexity of path coloring and call scheduling" }
Showing triples 1 to 1 of
1
with
100
triples per page.
S0304-3975(99)00152-8
title
"
The complexity of path coloring and call scheduling
"
.