在大规模锦标赛中发现并计数小型锦标赛
Finding and counting small tournaments in large tournaments
AI总结:
本文研究在大规模锦标赛中检测和计数小型子锦标赛的算法,给出了四顶点和五顶点锦标赛的快速检测与计数时间复杂度,并建立了与无向团计数问题之间的下界联系。
摘要:
我们提出了在给定锦标赛中计数和检测小型锦标赛的新算法。特别地,证明了每个四顶点锦标赛(共有四个)可以在 $O(n^2)$ 时间内被检测,并可在 $O(n^ω)$ 时间内被计数,其中 $ω< 2.373$ 是矩阵乘法指数。还证明了任意五顶点锦标赛(共有 $12$ 个)可以在 $O(n^{ω+1})$ 时间内被计数。关于下界,我们证明对于几乎所有 $k$-顶点锦标赛,检测问题的复杂度不低于相应的、已被充分研究的阶为 $k-O(\log k)$ 的无向团计数问题的复杂度。
英文摘要:
We present new algorithms for counting and detecting small tournaments in a given tournament. In particular, it is proved that every tournament on four vertices (there are four) can be detected in $O(n^2)$ time and counted in $O(n^ω)$ time where $ω< 2.373$ is the matrix multiplication exponent. It is also proved that any tournament on five vertices (there are $12$) can be counted in $O(n^{ω+1})$ time. As for lower-bounds, we prove that for almost all $k$-vertex tournaments, the complexity of the detection problem is not easier than the complexity of the corresponding well-studied counting problem for {\em undirected cliques} of order $k-O(\log k)$.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。