This HTML5 document contains 77 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
dcthttp://purl.org/dc/terms/
dbohttp://dbpedia.org/ontology/
foafhttp://xmlns.com/foaf/0.1/
dbpedia-eshttp://es.dbpedia.org/resource/
n18https://global.dbpedia.org/id/
yagohttp://dbpedia.org/class/yago/
dbthttp://dbpedia.org/resource/Template:
rdfshttp://www.w3.org/2000/01/rdf-schema#
freebasehttp://rdf.freebase.com/ns/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
owlhttp://www.w3.org/2002/07/owl#
wikipedia-enhttp://en.wikipedia.org/wiki/
dbphttp://dbpedia.org/property/
dbchttp://dbpedia.org/resource/Category:
provhttp://www.w3.org/ns/prov#
xsdhhttp://www.w3.org/2001/XMLSchema#
goldhttp://purl.org/linguistics/gold/
wikidatahttp://www.wikidata.org/entity/
dbrhttp://dbpedia.org/resource/

Statements

Subject Item
dbr:Ronald_Graham
dbo:wikiPageWikiLink
dbr:Coffman–Graham_algorithm
dbo:knownFor
dbr:Coffman–Graham_algorithm
Subject Item
dbr:Edward_G._Coffman_Jr.
dbo:wikiPageWikiLink
dbr:Coffman–Graham_algorithm
Subject Item
dbr:Topological_sorting
dbo:wikiPageWikiLink
dbr:Coffman–Graham_algorithm
Subject Item
dbr:Weak_ordering
dbo:wikiPageWikiLink
dbr:Coffman–Graham_algorithm
Subject Item
dbr:Coffman-Graham_algorithm
dbo:wikiPageWikiLink
dbr:Coffman–Graham_algorithm
dbo:wikiPageRedirects
dbr:Coffman–Graham_algorithm
Subject Item
dbr:Job-shop_scheduling
dbo:wikiPageWikiLink
dbr:Coffman–Graham_algorithm
Subject Item
dbr:Layered_graph_drawing
dbo:wikiPageWikiLink
dbr:Coffman–Graham_algorithm
Subject Item
dbr:Partition_refinement
dbo:wikiPageWikiLink
dbr:Coffman–Graham_algorithm
Subject Item
dbr:Graph_drawing
dbo:wikiPageWikiLink
dbr:Coffman–Graham_algorithm
Subject Item
dbr:Coffman–Graham_algorithm
rdf:type
yago:WikicatSchedulingAlgorithms yago:Act100030358 yago:Event100029378 yago:WikicatOptimizationAlgorithmsAndMethods yago:PsychologicalFeature100023100 yago:YagoPermanentlyLocatedEntity yago:Procedure101023820 dbo:Software yago:Abstraction100002137 yago:Algorithm105847438 yago:Activity100407535 yago:Rule105846932
rdfs:label
Coffman–Graham algorithm Algoritmo de Coffman-Graham
rdfs:comment
En y , el algoritmo Coffman-Graham es un proceso de cálculo, llamado así por y Ronald Graham, cuyo fin es organizar los elementos de un conjunto parcialmente ordenado en una secuencia de niveles. El algoritmo elige una disposición tal que un elemento que viene después de otro en el orden se asigna a un nivel inferior, y tal que cada nivel W contiene elementos que no superan una amplitud dada. Cuando W = 2 se utiliza la cantidad mínima posible de niveles distintos,​ y, en general, se utilizan como máximo 2 − 2/W veces tantos niveles como sea necesario.​​ 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.
dct:subject
dbc:Graph_drawing dbc:Optimal_scheduling dbc:Processor_scheduling_algorithms
dbo:wikiPageID
31501543
dbo:wikiPageRevisionID
1063792546
dbo:wikiPageWikiLink
dbr:Layered_graph_drawing dbr:Transitive_reduction dbr:Directed_graph dbr:Directed_acyclic_graph dbr:Reverse_graph dbr:Partition_refinement dbc:Graph_drawing dbr:Partially_ordered_set dbr:Linear_time dbr:Covering_relation dbr:Edward_G._Coffman,_Jr. dbr:Makespan dbr:Permutation dbr:Ronald_Graham dbc:Optimal_scheduling dbr:Graph_drawing dbr:Topological_sorting dbr:Feedback_arc_set dbr:Crossing_number_(graph_theory) dbr:Disjoint-set_data_structure dbr:Algorithm dbr:Interval_order dbr:Integer_programming dbr:Total_flow_time dbr:Lexicographic_order dbr:Reachability dbc:Processor_scheduling_algorithms dbr:Job_shop_scheduling
owl:sameAs
dbpedia-es:Algoritmo_de_Coffman-Graham wikidata:Q5141033 freebase:m.0glplkd n18:4hpSw
dbp:wikiPageUsesTemplate
dbt:Mvar dbt:Reflist dbt:Harvtxt dbt:Short_description dbt:Math
dbo: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. En y , el algoritmo Coffman-Graham es un proceso de cálculo, llamado así por y Ronald Graham, cuyo fin es organizar los elementos de un conjunto parcialmente ordenado en una secuencia de niveles. El algoritmo elige una disposición tal que un elemento que viene después de otro en el orden se asigna a un nivel inferior, y tal que cada nivel W contiene elementos que no superan una amplitud dada. Cuando W = 2 se utiliza la cantidad mínima posible de niveles distintos,​ y, en general, se utilizan como máximo 2 − 2/W veces tantos niveles como sea necesario.​​
gold:hypernym
dbr:Algorithm
prov:wasDerivedFrom
wikipedia-en:Coffman–Graham_algorithm?oldid=1063792546&ns=0
dbo:wikiPageLength
14114
foaf:isPrimaryTopicOf
wikipedia-en:Coffman–Graham_algorithm
Subject Item
dbr:Microsoft_Automatic_Graph_Layout
dbo:wikiPageWikiLink
dbr:Coffman–Graham_algorithm
Subject Item
wikipedia-en:Coffman–Graham_algorithm
foaf:primaryTopic
dbr:Coffman–Graham_algorithm