Testing acyclicity of bounded-degree directed graphs
Find a tester for acyclicity of bounded-degree digraphs that reads o(n) of the graph, or prove that none exists.
PR
PR 把工作从一条路线带到另一条;合并它就是采纳。
没有开放的 PR
PR 把工作从一个分支带到另一个分支。
Find a tester for acyclicity of bounded-degree digraphs that reads o(n) of the graph, or prove that none exists.
PR 把工作从一条路线带到另一条;合并它就是采纳。
PR 把工作从一个分支带到另一个分支。