no code implementations • 17 Feb 2020 • Frank Kammer, Andrej Sajenko
As an application of our algorithms above we give an algorithm for tree isomorphism, which runs in $O(n)$ time and uses $O(n)$ bits on $n$-node trees.
Data Structures and Algorithms F.2.2
no code implementations • 1 Jul 2019 • Frank Kammer, Johannes Meintrup, Andrej Sajenko
Practical applications that use treewidth algorithms have graphs with treewidth k = O(\sqrt[3]n).
Data Structures and Algorithms
no code implementations • 26 Mar 2018 • Frank Kammer, Andrej Sajenko
Many succinct data structures on the word RAM require precomputed tables to start operating.
Data Structures and Algorithms F.2.2
no code implementations • 12 Mar 2018 • Frank Kammer, Andrej Sajenko
We present an in-place depth first search (DFS) and an in- place breadth first search (BFS) that runs in the restore model in linear time.
Data Structures and Algorithms F.2.2; G.2.2
