Matches in DBpedia 2015-10 for { <http://dbpedia.org/resource/Coffman–Graham_algorithm> ?p ?o }
Showing triples 1 to 55 of
55
with 100 triples 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 wikiPageLength "13994".
- Coffman–Graham_algorithm wikiPageOutDegree "29".
- Coffman–Graham_algorithm wikiPageRevisionID "669091963".
- Coffman–Graham_algorithm wikiPageWikiLink Algorithm.
- Coffman–Graham_algorithm wikiPageWikiLink Category:Graph_drawing.
- Coffman–Graham_algorithm wikiPageWikiLink Category:Optimization_algorithms_and_methods.
- Coffman–Graham_algorithm wikiPageWikiLink Category:Scheduling_algorithms.
- Coffman–Graham_algorithm wikiPageWikiLink Covering_relation.
- Coffman–Graham_algorithm wikiPageWikiLink Crossing_number_(graph_theory).
- Coffman–Graham_algorithm wikiPageWikiLink Directed_acyclic_graph.
- Coffman–Graham_algorithm wikiPageWikiLink Directed_graph.
- Coffman–Graham_algorithm wikiPageWikiLink Disjoint-set_data_structure.
- Coffman–Graham_algorithm wikiPageWikiLink Edward_G._Coffman,_Jr..
- Coffman–Graham_algorithm wikiPageWikiLink Feedback_arc_set.
- Coffman–Graham_algorithm wikiPageWikiLink Graph_drawing.
- Coffman–Graham_algorithm wikiPageWikiLink Integer_programming.
- Coffman–Graham_algorithm wikiPageWikiLink Interval_order.
- Coffman–Graham_algorithm wikiPageWikiLink Job_shop_scheduling.
- Coffman–Graham_algorithm wikiPageWikiLink Layered_graph_drawing.
- Coffman–Graham_algorithm wikiPageWikiLink Lexicographic_order.
- Coffman–Graham_algorithm wikiPageWikiLink Lexicographical_order.
- Coffman–Graham_algorithm wikiPageWikiLink Linear_time.
- Coffman–Graham_algorithm wikiPageWikiLink Makespan.
- Coffman–Graham_algorithm wikiPageWikiLink Microsoft_Automatic_Graph_Layout.
- Coffman–Graham_algorithm wikiPageWikiLink Partially_ordered_set.
- Coffman–Graham_algorithm wikiPageWikiLink Partition_refinement.
- Coffman–Graham_algorithm wikiPageWikiLink Permutation.
- Coffman–Graham_algorithm wikiPageWikiLink Reachability.
- Coffman–Graham_algorithm wikiPageWikiLink Reverse_graph.
- Coffman–Graham_algorithm wikiPageWikiLink Ronald_Graham.
- Coffman–Graham_algorithm wikiPageWikiLink Time_complexity.
- Coffman–Graham_algorithm wikiPageWikiLink Topological_sorting.
- Coffman–Graham_algorithm wikiPageWikiLink Total_flow_time.
- Coffman–Graham_algorithm wikiPageWikiLink Transitive_reduction.
- Coffman–Graham_algorithm wikiPageWikiLink Transpose_graph.
- Coffman–Graham_algorithm wikiPageWikiLinkText "Coffman-Graham scheduling algorithm".
- Coffman–Graham_algorithm wikiPageWikiLinkText "Coffman–Graham algorithm".
- Coffman–Graham_algorithm wikiPageWikiLinkText "lexicographic topological ordering".
- Coffman–Graham_algorithm hasPhotoCollection Coffman–Graham_algorithm.
- Coffman–Graham_algorithm wikiPageUsesTemplate Template:Harvtxt.
- Coffman–Graham_algorithm wikiPageUsesTemplate Template:Math.
- Coffman–Graham_algorithm wikiPageUsesTemplate Template:Mvar.
- Coffman–Graham_algorithm wikiPageUsesTemplate Template:Reflist.
- 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 m.0glplkd.
- Coffman–Graham_algorithm sameAs Q5141033.
- Coffman–Graham_algorithm sameAs Q5141033.
- Coffman–Graham_algorithm wasDerivedFrom Coffman–Graham_algorithm?oldid=669091963.
- Coffman–Graham_algorithm isPrimaryTopicOf Coffman–Graham_algorithm.