Tuukka Korhonen, Dynamic Treewidth in Logarithmic Time
Room B332 IBS (기초과학연구원)We present a dynamic data structure that maintains a tree decomposition of width at most 9k+8 of a dynamic graph with treewidth at most k, which is updated by edge …
We present a dynamic data structure that maintains a tree decomposition of width at most 9k+8 of a dynamic graph with treewidth at most k, which is updated by edge …