Linear extension: Difference between revisions

Revision as of 16:29, 18 December 2014

Revision as of 15:41, 9 February 2015

Line 50:

==Related results==

The order extension principle is [[algorithmicconstructive proof|constructively provable]] problemfor of''finite'' constructingsets ausing linear[[topological extensionsorting]] ofalgorithms, awhere the partial order on a finite set,is represented by a [[directed acyclic graph]] with the set's elements as its [[vertex (graph theory)|vertices]],. isSeveral knownalgorithms ascan [[topologicalfind sorting]];an several algorithms solve itextension in [[linear time]].<ref>{{citation

| last1 = Cormen | first1 = Thomas H. | author1-link = Thomas H. Cormen

| last2 = Leiserson | first2 = Charles E. | author2-link = Charles E. Leiserson