Tuukka Korhonen, Dynamic Treewidth in Logarithmic Time
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 …
1 event found.
기초과학연구원 이산수학그룹