Matches in DBpedia 2016-04 for { <http://wikidata.dbpedia.org/resource/Q5141033> ?p ?o }
Showing triples 1 to 33 of
33
with 100 triples per page.
- Q5141033 subject Q7153685.
- Q5141033 subject Q8498908.
- Q5141033 subject Q8707181.
- Q5141033 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.".
- Q5141033 wikiPageWikiLink Q1137726.
- Q5141033 wikiPageWikiLink Q1144915.
- Q5141033 wikiPageWikiLink Q1195339.
- Q5141033 wikiPageWikiLink Q1259393.
- Q5141033 wikiPageWikiLink Q1361526.
- Q5141033 wikiPageWikiLink Q1400910.
- Q5141033 wikiPageWikiLink Q161519.
- Q5141033 wikiPageWikiLink Q2393193.
- Q5141033 wikiPageWikiLink Q266775.
- Q5141033 wikiPageWikiLink Q3088151.
- Q5141033 wikiPageWikiLink Q3491411.
- Q5141033 wikiPageWikiLink Q474715.
- Q5141033 wikiPageWikiLink Q5100264.
- Q5141033 wikiPageWikiLink Q5179263.
- Q5141033 wikiPageWikiLink Q6042592.
- Q5141033 wikiPageWikiLink Q6057290.
- Q5141033 wikiPageWikiLink Q6206757.
- Q5141033 wikiPageWikiLink Q6505531.
- Q5141033 wikiPageWikiLink Q6840085.
- Q5141033 wikiPageWikiLink Q712620.
- Q5141033 wikiPageWikiLink Q7140650.
- Q5141033 wikiPageWikiLink Q7153685.
- Q5141033 wikiPageWikiLink Q739462.
- Q5141033 wikiPageWikiLink Q753127.
- Q5141033 wikiPageWikiLink Q8366.
- Q5141033 wikiPageWikiLink Q8498908.
- Q5141033 wikiPageWikiLink Q8707181.
- Q5141033 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.".
- Q5141033 label "Coffman–Graham algorithm".