Coffman–Graham algorithm
id:
coffman-graham-algorithm-273-11491196
title:
Coffman–Graham algorithm
text:
The Coffman–Graham algorithm is an algorithm 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. It is named
brand slug:
wiki
category slug:
encyclopedia
description:
Method for partitioning partial orders into levels
original url:
https://en.wikipedia.org/wiki/Coffman%E2%80%93Graham_algorithm
date created:
date modified:
2023-11-02T23:11:59Z
main entity:
{"identifier":"Q5141033","url":"https://www.wikidata.org/entity/Q5141033"}
image:
fields total:
13
integrity:
14