@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}
}

{"_id":"k3cpGe7Bjsi7XAw9p","bibbaseid":"anonymous-coffmangrahamalgorithm-2014","authorIDs":[],"bibdata":{"bibtype":"misc","type":"misc","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":"March","year":"2014","note":"Page Version ID: 569364546","bibtex":"@misc{noauthor_coffmangraham_2014,\n\ttitle = {Coffman–{Graham} algorithm},\n\tcopyright = {Creative Commons Attribution-ShareAlike License},\n\turl = {http://en.wikipedia.org/w/index.php?title=Coffman%E2%80%93Graham_algorithm&oldid=569364546},\n\tabstract = {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]},\n\tlanguage = {en},\n\turldate = {2014-04-27},\n\tjournal = {Wikipedia, the free encyclopedia},\n\tmonth = mar,\n\tyear = {2014},\n\tnote = {Page Version ID: 569364546}\n}\n\n","key":"noauthor_coffmangraham_2014","id":"noauthor_coffmangraham_2014","bibbaseid":"anonymous-coffmangrahamalgorithm-2014","urls":{"Paper":"http://en.wikipedia.org/w/index.php?title=Coffman%E2%80%93Graham_algorithm&oldid=569364546"},"downloads":0},"bibtype":"misc","biburl":"https://bibbase.org/zotero/moorepants","creationDate":"2019-12-04T16:23:11.345Z","downloads":0,"keywords":[],"search_terms":["coffman","graham","algorithm"],"title":"Coffman–Graham algorithm","year":2014,"dataSources":["kGdXP2S4pPvthm6Pa"]}