Space-Efficient Vertex Separators for Treewidth

1 Jul 2019Frank KammerJohannes MeintrupAndrej Sajenko

Practical applications that use treewidth algorithms have graphs with treewidth k = O(\sqrt[3]n). Given such n-vertex graphs we present a word-RAM algorithm to compute vertex separators using only O(n) bits of working memory... (read more)

PDF Abstract


No code implementations yet. Submit your code now


Results from the Paper

  Submit results from this paper to get state-of-the-art GitHub badges and help the community compare results to other papers.