March, 2014. Page Version ID: 569364546

Paper abstract bibtex

Paper abstract bibtex

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,[1] and in general it uses at most 2 − 2/W times as many levels as necessary.[2][3]

@misc{noauthor_coffmangraham_2014, title = {Coffman–{Graham} algorithm}, copyright = {Creative Commons Attribution-ShareAlike License}, url = {http://en.wikipedia.org/w/index.php?title=Coffman%E2%80%93Graham_algorithm&oldid=569364546}, 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,[1] and in general it uses at most 2 − 2/W times as many levels as necessary.[2][3]}, language = {en}, urldate = {2014-04-27}, journal = {Wikipedia, the free encyclopedia}, month = mar, year = {2014}, note = {Page Version ID: 569364546} }

Downloads: 0