All public logs

Combined display of all available logs of Algorithm Wiki. You can narrow down the view by selecting a log type, the username (case-sensitive), or the affected page (also case-sensitive).

• 11:36, 15 February 2023 Admin talk contribs created page Beigel & Eppstein (3-Graph Coloring Graph Coloring) (Created page with "== Time Complexity == $O({1.3446}^n)$ == Space Complexity == $O(n^{2})$? words (can be derived from steps of algorithm? you add at most O(n^2) constraints, other info shouldn't take more than O(n^2) space, and you can reuse space during recursive steps) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1995 == Reference == https://ieeexplore.ieee.org/stamp/stamp.jsp?arnum...")