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 "The greedy algorithm is optimal for on-line edge coloring" }
Showing triples 1 to 1 of
1
with
100
triples per page.
0020-0190(92)90209-e
title
"
The greedy algorithm is optimal for on-line edge coloring
"
.
