利用类切换加速图算法
Speeding Up Graph Algorithms via Switching Classes
摘要:
给定一个图$G$,$v \in V(G)$的顶点交换导致一个新的图,其中$v$的邻居成为非邻居,反之亦然。这个操作在$n$顶点上的标记有向图的集合上产生等价关系。$G$关于切换操作的等价类通常被称为$G$的切换类。切换类的代数和组合性质已得到深入研究;然而,从算法的角度来看,它们尚未得到彻底的研究。这项工作的目的是进一步调查的算法属性切换类。特别是,我们表明,开关类可以用来渐近加速几个超线性未加权图算法。目前用于加速图形算法的技术都在某种程度上涉及到它们采用复杂的预处理、数据结构或在RAM模型上使用“文字技巧”来实现对于足够密集的图形的至多$O(\log(n))$加速。我们的方法要简单得多,可以导致超多对数加速。特别是,我们实现了更好的范围直径,传递闭包,二分最大匹配,一般最大匹配。
英文摘要:
Given a graph $G$, a vertex switch of $v \in V(G)$ results in a new graph where neighbors of $v$ become nonneighbors and vice versa. This operation gives rise to an equivalence relation over the set of labeled digraphs on $n$ vertices. The equivalence class of $G$ with respect to the switching operation is commonly referred to as $G$'s switching class. The algebraic and combinatorial properties of switching classes have been studied in depth; however, they have not been studied as thoroughly from an algorithmic point of view. The intent of this work is to further investigate the algorithmic properties of switching classes. In particular, we show that switching classes can be used to asymptotically speed up several super-linear unweighted graph algorithms. The current techniques for speeding up graph algorithms are all somewhat involved insofar that they employ sophisticated pre-processing, data-structures, or use "word tricks" on the RAM model to achieve at most a $O(\log(n))$ speed up for sufficiently dense graphs. Our methods are much simpler and can result in super-polylogarithmic speedups. In particular, we achieve better bounds for diameter, transitive closure, bipartite maximum matching, and general maximum matching.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。