About: Coffman–Graham algorithm

Facets (new session)
Description
Metadata
Settings
- Rule:
- Inverse Functional Properties:
- "Same As":

About: Coffman–Graham algorithm Goto Sponge NotDistinct Permalink

An Entity of Type : yago:Rule105846932, within Data Space : dbpedia.demo.openlinksw.com associated with source document(s)
QRcode icon

http://dbpedia.demo.openlinksw.com/describe/?url=http%3A%2F%2Fdbpedia.org%2Fresource%2FCoffman%E2%80%93Graham_algorithm&invfp=IFP_OFF&sas=SAME_AS_OFF

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.

Attributes	Values
rdf:type	software yago:WikicatOptimizationAlgorithmsAndMethods yago:WikicatSchedulingAlgorithms yago:Abstraction100002137 yago:Act100030358 yago:Activity100407535 yago:Algorithm105847438 yago:Event100029378 yago:Procedure101023820 yago:PsychologicalFeature100023100 yago:YagoPermanentlyLocatedEntity yago:Rule105846932
rdfs:label	Algoritmo de Coffman-Graham (es) Coffman–Graham algorithm (en)
rdfs: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. 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) 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. (es)
dcterms:subject	Optimal scheduling Processor scheduling algorithms Graph drawing
Wikipage page ID	31501543 (xsd:integer)
Wikipage revision ID	1063792546 (xsd:integer)
Link from a Wikipage to another Wikipage	Ronald Graham Algorithm Permutation Integer programming Interval order Crossing number (graph theory) Lexicographic order Linear time Feedback arc set Makespan Optimal scheduling Processor scheduling algorithms Topological sorting Layered graph drawing Transitive reduction Graph drawing Partially ordered set Partition refinement Directed graph Graph drawing Reachability Covering relation Directed acyclic graph Disjoint-set data structure Edward G. Coffman, Jr. Makespan Reverse graph dbr:Total_flow_time
sameAs	Coffman–Graham algorithm Coffman–Graham algorithm Coffman–Graham algorithm Coffman–Graham algorithm
dbp:wikiPageUsesTemplate	dbt:Harvtxt dbt:Math dbt:Mvar dbt:Reflist dbt:Short_description
has 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) 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. (es)
gold:hypernym	Algorithm
prov:wasDerivedFrom	wikipedia-en:Coffman–Graham_algorithm?oldid=1063792546&ns=0
page length (characters) of wiki page	14114 (xsd:nonNegativeInteger)
foaf:isPrimaryTopicOf	wikipedia-en:Coffman–Graham_algorithm
is Link from a Wikipage to another Wikipage of	Ronald Graham Edward G. Coffman Jr. Topological sorting Preference relation Coffman-Graham algorithm Job-shop scheduling Layered graph drawing Partition refinement Graph drawing Microsoft Automatic Graph Layout
is Wikipage redirect of	Coffman-Graham algorithm
is known for of	Ronald Graham
is foaf:primaryTopic of	wikipedia-en:Coffman–Graham_algorithm

Faceted Search & Find service v1.17_git139 as of Feb 29 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 08.03.3330 as of Mar 19 2024, on Linux (x86_64-generic-linux-glibc212), Single-Server Edition (378 GB total memory, 67 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software