Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Coffman–Graham_algorithm> ?p ?o. }
Showing items 1 to 12 of
12
with 100 items per page.
- Coffman–Graham_algorithm abstract "In job shop scheduling and graph drawing, the Coffman–Graham algorithm is an algorithm, named after Edward G. Coffman, Jr. and Ronald Graham, for arranging the elements of a partially ordered set into a sequence of levels. The algorithm chooses an arrangement such that an element that comes after another in the order is assigned to a lower level, and such that each level has a number of elements that does not exceed a fixed width bound W. When W = 2, it uses the minimum possible number of distinct levels, and in general it uses at most 2 − 2/W times as many levels as necessary.".
- Coffman–Graham_algorithm wikiPageID "31501543".
- Coffman–Graham_algorithm wikiPageRevisionID "569364546".
- Coffman–Graham_algorithm subject Category:Graph_drawing.
- Coffman–Graham_algorithm subject Category:Optimization_algorithms_and_methods.
- Coffman–Graham_algorithm subject Category:Scheduling_algorithms.
- Coffman–Graham_algorithm comment "In job shop scheduling and graph drawing, the Coffman–Graham algorithm is an algorithm, named after Edward G. Coffman, Jr. and Ronald Graham, for arranging the elements of a partially ordered set into a sequence of levels. The algorithm chooses an arrangement such that an element that comes after another in the order is assigned to a lower level, and such that each level has a number of elements that does not exceed a fixed width bound W.".
- Coffman–Graham_algorithm label "Coffman–Graham algorithm".
- Coffman–Graham_algorithm sameAs Coffman%E2%80%93Graham_algorithm.
- Coffman–Graham_algorithm sameAs Q5141033.
- Coffman–Graham_algorithm sameAs Q5141033.
- Coffman–Graham_algorithm wasDerivedFrom Coffman–Graham_algorithm?oldid=569364546.