Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Greedy_coloring> ?p ?o. }
Showing items 1 to 23 of
23
with 100 items per page.
- Greedy_coloring 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.".
- Greedy_coloring thumbnail Greedy_colourings.svg?width=300.
- Greedy_coloring wikiPageID "21051195".
- Greedy_coloring wikiPageRevisionID "545539905".
- Greedy_coloring hasPhotoCollection Greedy_coloring.
- Greedy_coloring subject Category:Graph_coloring.
- Greedy_coloring type Abstraction100002137.
- Greedy_coloring type Communication100033020.
- Greedy_coloring type Graph107000195.
- Greedy_coloring type PerfectGraphs.
- Greedy_coloring type VisualCommunication106873252.
- Greedy_coloring 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_coloring label "Colorazione golosa".
- Greedy_coloring label "Greedy coloring".
- Greedy_coloring label "Жадная раскраска".
- Greedy_coloring sameAs Colorazione_golosa.
- Greedy_coloring sameAs m.05b62q1.
- Greedy_coloring sameAs Q5601715.
- Greedy_coloring sameAs Q5601715.
- Greedy_coloring sameAs Greedy_coloring.
- Greedy_coloring wasDerivedFrom Greedy_coloring?oldid=545539905.
- Greedy_coloring depiction Greedy_colourings.svg.
- Greedy_coloring isPrimaryTopicOf Greedy_coloring.