距离与匹配的动态元定理
Dynamic Meta-theorems for Distance and Matching
摘要:
可达性,距离和匹配是近年来动态复杂性理论特别感兴趣的一些最基本的图问题[DKMSZ 18,DMVZ 18,DKMTVZ 20]。可达性可以用一阶更新公式来维护,或者等价地在DynFO中具有n个节点的一般图中[DKMSZ 18],即使在每步O(log n/loglog n)变化[DMVZ 18]。在可以处理多大数量的更改的上下文中,最近已经表明[DKMTVZ 20],在多对数数量的更改下,可达性在DynFOpar中在平面,有界树宽和相关的图形类中-实际上在任何图形中,可以在NC中计算小的非零循环权重。我们继续这条线的调查,并延长元定理的可达性的距离和二部最大匹配相同的界限。这些是已知的最一般的图类,我们可以在不使用多数量词的情况下确定性地维护这些问题,甚至维护证人。对于二分匹配结果,我们改进了[FGT]的方法,将静态非零循环权值转换为动态匹配隔离权值。虽然可达性是在DynFOar下O(log n/loglog n)的变化,没有这样的界限是已知的距离或匹配在任何非平凡类的图下的非常数的变化。我们发现,在相同的类的图之前,二部最大匹配是在DynFOar下O(log n/loglog n)的变化每一步。在展示这一点的过程中,我们证明了矩阵的秩可以在DynFOar中保持,也可以在O(log n/loglog n)条目更改下保持,改进了以前的O(1)界[DKMSZ 18]。这意味着对一般图中最大匹配的非均匀DynFO界进行类似的扩展,以及在O(log n/loglog n)变化下保持可达性的替代算法[DMVZ 18]。
英文摘要:
Reachability, distance, and matching are some of the most fundamental graph problems that have been of particular interest in dynamic complexity theory in recent years [DKMSZ18, DMVZ18, DKMTVZ20]. Reachability can be maintained with first-order update formulas, or equivalently in DynFO in general graphs with n nodes [DKMSZ18], even under O(log n/loglog n) changes per step [DMVZ18]. In the context of how large the number of changes can be handled, it has recently been shown [DKMTVZ20] that under a polylogarithmic number of changes, reachability is in DynFOpar in planar, bounded treewidth, and related graph classes -- in fact in any graph where small non-zero circulation weights can be computed in NC. We continue this line of investigation and extend the meta-theorem for reachability to distance and bipartite maximum matching with the same bounds. These are amongst the most general classes of graphs known where we can maintain these problems deterministically without using a majority quantifier and even maintain witnesses. For the bipartite matching result, modifying the approach from [FGT], we convert the static non-zero circulation weights to dynamic matching-isolating weights. While reachability is in DynFOar under O(log n/loglog n) changes, no such bound is known for either distance or matching in any non-trivial class of graphs under non-constant changes. We show that, in the same classes of graphs as before, bipartite maximum matching is in DynFOar under O(log n/loglog n) changes per step. En route to showing this we prove that the rank of a matrix can be maintained in DynFOar, also under O(log n/loglog n) entry changes, improving upon the previous O(1) bound [DKMSZ18]. This implies similar extension for the non-uniform DynFO bound for maximum matching in general graphs and an alternate algorithm for maintaining reachability under O(log n/loglog n) changes [DMVZ18].
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。