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.

shoal Update scienceslack.json from shoal-catalog d1cbb60b3b19 a2aa68b · 2周前历史

24 行 · 474 Bytes 原始文件永久链接历史

1	{
2	"domain": "computer-science",
3	"topics": [
4	"algorithms-complexity",
5	"graph-theory"
6	],
7	"type": "algorithm",
8	"also": [
9	"proof"
10	],
11	"source": {
12	"key": "sublinear",
13	"name": "Sublinear.info",
14	"url": "https://sublinear.info/41",
15	"id": "41",
16	"curator": "Sublinear.info editors",
17	"poser": "Dana Ron",
18	"status": "open",
19	"as_of": "2026-10-20",
20	"catalog": "0521c19bbd38"
21	},
22	"review": true,
23	"approval": "first-time"
24	}