Kleitman–Wang Algorithm (Digraph Realization Problem Graph Realization Problems): Revision history

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

    15 February 2023

    • curprev 11:1611:16, 15 February 2023‎ Admin talk contribs‎ 425 bytes +425‎ Created page with "== Time Complexity == $O(n)$ == Space Complexity == $O(n)$ words (Derived: Space complexity bounded by time complexity; keep track of a constant number of sets of size $O(n)$) == Description == Constructs graph == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1973 == Reference == https://linkinghub.elsevier.com/retrieve/pii/0012365X7390037X"
Retrieved from "https://algorithm-wiki.csail.mit.edu/wiki/Kleitman–Wang_Algorithm_(Digraph_Realization_Problem_Graph_Realization_Problems)"