Matches in DBpedia 2016-04 for { <http://wikidata.dbpedia.org/resource/Q5601715> ?p ?o }
Showing triples 1 to 36 of
36
with 100 triples per page.
- Q5601715 subject Q7016011.
- Q5601715 abstract "In the study of graph coloring problems in mathematics and computer science, a greedy coloring is a coloring of the vertices of a graph formed by a greedy algorithm that considers the vertices of the graph in sequence and assigns each vertex its first available color. Greedy colorings do not in general use the minimum number of colors possible. However, they have been used in mathematics as a technique for proving other results about colorings and in computer science as a heuristic to find colorings with few colors.".
- Q5601715 thumbnail Greedy_colourings.svg?width=300.
- Q5601715 wikiPageWikiLink Q1065144.
- Q5601715 wikiPageWikiLink Q1137554.
- Q5601715 wikiPageWikiLink Q1304193.
- Q5601715 wikiPageWikiLink Q1322892.
- Q5601715 wikiPageWikiLink Q141488.
- Q5601715 wikiPageWikiLink Q17148818.
- Q5601715 wikiPageWikiLink Q174733.
- Q5601715 wikiPageWikiLink Q21198.
- Q5601715 wikiPageWikiLink Q215206.
- Q5601715 wikiPageWikiLink Q3085841.
- Q5601715 wikiPageWikiLink Q3115466.
- Q5601715 wikiPageWikiLink Q3186905.
- Q5601715 wikiPageWikiLink Q383444.
- Q5601715 wikiPageWikiLink Q395.
- Q5601715 wikiPageWikiLink Q45715.
- Q5601715 wikiPageWikiLink Q504353.
- Q5601715 wikiPageWikiLink Q504843.
- Q5601715 wikiPageWikiLink Q512897.
- Q5601715 wikiPageWikiLink Q5155607.
- Q5601715 wikiPageWikiLink Q5156350.
- Q5601715 wikiPageWikiLink Q5251771.
- Q5601715 wikiPageWikiLink Q5282038.
- Q5601715 wikiPageWikiLink Q5282847.
- Q5601715 wikiPageWikiLink Q622506.
- Q5601715 wikiPageWikiLink Q7016011.
- Q5601715 wikiPageWikiLink Q7661883.
- Q5601715 wikiPageWikiLink Q7727237.
- Q5601715 wikiPageWikiLink Q786431.
- Q5601715 wikiPageWikiLink Q835942.
- Q5601715 wikiPageWikiLink Q913598.
- Q5601715 comment "In the study of graph coloring problems in mathematics and computer science, a greedy coloring is a coloring of the vertices of a graph formed by a greedy algorithm that considers the vertices of the graph in sequence and assigns each vertex its first available color. Greedy colorings do not in general use the minimum number of colors possible.".
- Q5601715 label "Greedy coloring".
- Q5601715 depiction Greedy_colourings.svg.