Kleitman–Wang Algorithm (Digraph Realization Problem Graph Realization Problems)

From Algorithm Wiki
Revision as of 11:16, 15 February 2023 by Admin (talk | contribs) (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")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

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/w/index.php?title=Kleitman–Wang_Algorithm_(Digraph_Realization_Problem_Graph_Realization_Problems)&oldid=45474"