Berger & Müller-Hannemann (DAG Realization Problem Graph Realization Problems)

From Algorithm Wiki

Revision as of 12:16, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(\exp(n)$) == Space Complexity == ? words () == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 2011 == Reference == https://arxiv.org/abs/1203.3636")

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to navigation Jump to search

Time Complexity

$O(\exp(n)$)

Space Complexity

? words

()

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

2011

Reference

https://arxiv.org/abs/1203.3636

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Berger_%26_Müller-Hannemann_(DAG_Realization_Problem_Graph_Realization_Problems)&oldid=45475"