task_id stringlengths 23 52 | subset stringclasses 1
value | family stringclasses 80
values | problem_key stringclasses 75
values | domain stringclasses 8
values | tier stringclasses 2
values | level stringclasses 6
values | source stringclasses 80
values | license stringclasses 3
values | tags listlengths 0 4 | prompt stringlengths 308 37k | instance stringlengths 56 37.8k | direction null | baseline null | best_known null | reference_answer stringlengths 8 198k | reference_reward float64 1 1 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
construct-mc-vertex-cover-l6-s6 | construct | mc_vertex_cover | graph_vertex_cover | graph_theory | competition | 6 | MathConstraint/vertex_cover | CC-BY-4.0 | [
"np_search"
] | Graph G with 140 vertices numbered 0..139 and 1387 edges:
(0,3), (0,23), (0,30), (0,31), (0,33), (0,40), (0,69), (0,70), (0,75), (0,87), (0,101), (0,109), (0,112), (0,117), (0,118), (0,124), (0,125), (0,131), (0,136), (1,13), (1,17), (1,31), (1,39), (1,44), (1,48), (1,49), (1,52), (1,56), (1,103), (1,105), (1,108), (1,... | {"n": 140, "k": 107, "edges": [[0, 3], [0, 23], [0, 30], [0, 31], [0, 33], [0, 40], [0, 69], [0, 70], [0, 75], [0, 87], [0, 101], [0, 109], [0, 112], [0, 117], [0, 118], [0, 124], [0, 125], [0, 131], [0, 136], [1, 13], [1, 17], [1, 31], [1, 39], [1, 44], [1, 48], [1, 49], [1, 52], [1, 56], [1, 103], [1, 105], [1, 108],... | null | null | null | {"cover": [0, 2, 3, 4, 5, 6, 8, 9, 10, 11, 12, 13, 14, 15, 17, 18, 20, 21, 22, 23, 26, 28, 29, 30, 31, 32, 33, 36, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 52, 53, 55, 56, 58, 59, 60, 63, 64, 65, 66, 67, 70, 72, 74, 75, 76, 77, 78, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 92, 93, 94, 96, 98, 100, 103, 104... | 1 |
construct-mc-vertex-cover-l6-s7 | construct | mc_vertex_cover | graph_vertex_cover | graph_theory | competition | 6 | MathConstraint/vertex_cover | CC-BY-4.0 | [
"np_search"
] | Graph G with 140 vertices numbered 0..139 and 1359 edges:
(0,3), (0,4), (0,17), (0,28), (0,34), (0,36), (0,74), (0,75), (0,84), (0,97), (0,101), (0,113), (0,125), (0,127), (0,135), (0,137), (1,13), (1,40), (1,44), (1,48), (1,50), (1,53), (1,61), (1,67), (1,70), (1,74), (1,83), (1,85), (1,89), (1,90), (1,100), (1,101), ... | {"n": 140, "k": 107, "edges": [[0, 3], [0, 4], [0, 17], [0, 28], [0, 34], [0, 36], [0, 74], [0, 75], [0, 84], [0, 97], [0, 101], [0, 113], [0, 125], [0, 127], [0, 135], [0, 137], [1, 13], [1, 40], [1, 44], [1, 48], [1, 50], [1, 53], [1, 61], [1, 67], [1, 70], [1, 74], [1, 83], [1, 85], [1, 89], [1, 90], [1, 100], [1, 1... | null | null | null | {"cover": [0, 2, 3, 5, 7, 10, 12, 13, 14, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 27, 28, 29, 30, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 47, 48, 50, 51, 52, 53, 54, 56, 57, 58, 60, 61, 62, 64, 65, 66, 67, 69, 70, 71, 72, 73, 74, 75, 77, 78, 79, 80, 81, 82, 83, 85, 86, 88, 89, 90, 91, 93, 96, 97, 98, 99, 100, 101, ... | 1 |
construct-mc-vertex-cover-l6-s8 | construct | mc_vertex_cover | graph_vertex_cover | graph_theory | competition | 6 | MathConstraint/vertex_cover | CC-BY-4.0 | [
"np_search"
] | Graph G with 140 vertices numbered 0..139 and 1333 edges:
(0,4), (0,9), (0,16), (0,19), (0,30), (0,31), (0,34), (0,43), (0,60), (0,64), (0,69), (0,75), (0,77), (0,85), (0,88), (0,93), (0,100), (0,116), (0,133), (0,134), (1,6), (1,15), (1,44), (1,49), (1,63), (1,64), (1,66), (1,72), (1,84), (1,90), (1,91), (1,95), (1,13... | {"n": 140, "k": 107, "edges": [[0, 4], [0, 9], [0, 16], [0, 19], [0, 30], [0, 31], [0, 34], [0, 43], [0, 60], [0, 64], [0, 69], [0, 75], [0, 77], [0, 85], [0, 88], [0, 93], [0, 100], [0, 116], [0, 133], [0, 134], [1, 6], [1, 15], [1, 44], [1, 49], [1, 63], [1, 64], [1, 66], [1, 72], [1, 84], [1, 90], [1, 91], [1, 95], ... | null | null | null | {"cover": [0, 1, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 20, 22, 23, 24, 25, 26, 27, 30, 31, 32, 33, 36, 38, 39, 40, 41, 43, 44, 45, 46, 48, 49, 50, 51, 56, 57, 58, 59, 61, 62, 63, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 94, 95, 96, 98, 100, 103, 104, 1... | 1 |
construct-mc-vertex-cover-l6-s9 | construct | mc_vertex_cover | graph_vertex_cover | graph_theory | competition | 6 | MathConstraint/vertex_cover | CC-BY-4.0 | [
"np_search"
] | Graph G with 140 vertices numbered 0..139 and 1399 edges:
(0,4), (0,15), (0,16), (0,20), (0,22), (0,32), (0,34), (0,36), (0,37), (0,55), (0,60), (0,77), (0,90), (0,95), (0,101), (0,110), (0,114), (0,117), (0,121), (0,124), (0,126), (0,127), (1,2), (1,13), (1,14), (1,16), (1,18), (1,24), (1,31), (1,47), (1,54), (1,68), ... | {"n": 140, "k": 107, "edges": [[0, 4], [0, 15], [0, 16], [0, 20], [0, 22], [0, 32], [0, 34], [0, 36], [0, 37], [0, 55], [0, 60], [0, 77], [0, 90], [0, 95], [0, 101], [0, 110], [0, 114], [0, 117], [0, 121], [0, 124], [0, 126], [0, 127], [1, 2], [1, 13], [1, 14], [1, 16], [1, 18], [1, 24], [1, 31], [1, 47], [1, 54], [1, ... | null | null | null | {"cover": [0, 1, 2, 3, 4, 6, 7, 8, 9, 10, 11, 12, 14, 16, 17, 18, 19, 20, 21, 22, 23, 24, 26, 27, 28, 30, 31, 34, 35, 36, 37, 38, 39, 40, 41, 43, 45, 46, 47, 49, 50, 52, 53, 56, 57, 58, 59, 60, 62, 63, 65, 66, 68, 69, 70, 71, 72, 73, 74, 75, 77, 78, 79, 80, 83, 85, 86, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 99, 100, 1... | 1 |
construct-nppc-bandwidth-l1-s0 | construct | nppc_bandwidth | graph_bandwidth | graph_theory | competition | 1 | NPPC/bandwidth | MIT | [
"agentic_trivial",
"np_search"
] | Undirected graph with 6 vertices labelled 0..5 and 5 edges:
[[0, 1], [1, 2], [2, 3], [3, 4], [4, 5]]
Find a linear layout of bandwidth at most 3: assign to each vertex v a distinct position p[v] in 0..5 (a permutation) such that |p[u] - p[v]| <= 3 for every edge (u, v).
Answer format: {"layout": [p_0, p_1, ..., p_5]}... | {"num_nodes": 6, "bandwidth": 3, "edges": [[0, 1], [1, 2], [2, 3], [3, 4], [4, 5]], "family": "nppc_bandwidth", "subset": "construct"} | null | null | null | {"layout": [2, 0, 1, 4, 5, 3]} | 1 |
construct-nppc-bandwidth-l1-s1 | construct | nppc_bandwidth | graph_bandwidth | graph_theory | competition | 1 | NPPC/bandwidth | MIT | [
"agentic_trivial",
"np_search"
] | Undirected graph with 6 vertices labelled 0..5 and 5 edges:
[[0, 1], [1, 2], [2, 3], [3, 4], [4, 5]]
Find a linear layout of bandwidth at most 3: assign to each vertex v a distinct position p[v] in 0..5 (a permutation) such that |p[u] - p[v]| <= 3 for every edge (u, v).
Answer format: {"layout": [p_0, p_1, ..., p_5]}... | {"num_nodes": 6, "bandwidth": 3, "edges": [[0, 1], [1, 2], [2, 3], [3, 4], [4, 5]], "family": "nppc_bandwidth", "subset": "construct"} | null | null | null | {"layout": [0, 3, 5, 2, 1, 4]} | 1 |
construct-nppc-bandwidth-l1-s2 | construct | nppc_bandwidth | graph_bandwidth | graph_theory | competition | 1 | NPPC/bandwidth | MIT | [
"agentic_trivial",
"np_search"
] | Undirected graph with 6 vertices labelled 0..5 and 5 edges:
[[0, 1], [1, 2], [2, 4], [3, 4], [4, 5]]
Find a linear layout of bandwidth at most 3: assign to each vertex v a distinct position p[v] in 0..5 (a permutation) such that |p[u] - p[v]| <= 3 for every edge (u, v).
Answer format: {"layout": [p_0, p_1, ..., p_5]}... | {"num_nodes": 6, "bandwidth": 3, "edges": [[0, 1], [1, 2], [2, 4], [3, 4], [4, 5]], "family": "nppc_bandwidth", "subset": "construct"} | null | null | null | {"layout": [2, 0, 1, 5, 4, 3]} | 1 |
construct-nppc-bandwidth-l1-s3 | construct | nppc_bandwidth | graph_bandwidth | graph_theory | competition | 1 | NPPC/bandwidth | MIT | [
"agentic_trivial",
"np_search"
] | Undirected graph with 6 vertices labelled 0..5 and 5 edges:
[[0, 1], [1, 2], [2, 3], [3, 5], [4, 5]]
Find a linear layout of bandwidth at most 3: assign to each vertex v a distinct position p[v] in 0..5 (a permutation) such that |p[u] - p[v]| <= 3 for every edge (u, v).
Answer format: {"layout": [p_0, p_1, ..., p_5]}... | {"num_nodes": 6, "bandwidth": 3, "edges": [[0, 1], [1, 2], [2, 3], [3, 5], [4, 5]], "family": "nppc_bandwidth", "subset": "construct"} | null | null | null | {"layout": [4, 3, 1, 0, 5, 2]} | 1 |
construct-nppc-bandwidth-l1-s4 | construct | nppc_bandwidth | graph_bandwidth | graph_theory | competition | 1 | NPPC/bandwidth | MIT | [
"agentic_trivial",
"np_search"
] | Undirected graph with 6 vertices labelled 0..5 and 5 edges:
[[0, 1], [1, 2], [2, 3], [3, 4], [4, 5]]
Find a linear layout of bandwidth at most 3: assign to each vertex v a distinct position p[v] in 0..5 (a permutation) such that |p[u] - p[v]| <= 3 for every edge (u, v).
Answer format: {"layout": [p_0, p_1, ..., p_5]}... | {"num_nodes": 6, "bandwidth": 3, "edges": [[0, 1], [1, 2], [2, 3], [3, 4], [4, 5]], "family": "nppc_bandwidth", "subset": "construct"} | null | null | null | {"layout": [3, 4, 5, 2, 0, 1]} | 1 |
construct-nppc-bandwidth-l1-s5 | construct | nppc_bandwidth | graph_bandwidth | graph_theory | competition | 1 | NPPC/bandwidth | MIT | [
"agentic_trivial",
"np_search"
] | Undirected graph with 6 vertices labelled 0..5 and 5 edges:
[[0, 1], [1, 2], [2, 3], [3, 4], [4, 5]]
Find a linear layout of bandwidth at most 3: assign to each vertex v a distinct position p[v] in 0..5 (a permutation) such that |p[u] - p[v]| <= 3 for every edge (u, v).
Answer format: {"layout": [p_0, p_1, ..., p_5]}... | {"num_nodes": 6, "bandwidth": 3, "edges": [[0, 1], [1, 2], [2, 3], [3, 4], [4, 5]], "family": "nppc_bandwidth", "subset": "construct"} | null | null | null | {"layout": [1, 0, 3, 2, 4, 5]} | 1 |
construct-nppc-bandwidth-l1-s6 | construct | nppc_bandwidth | graph_bandwidth | graph_theory | competition | 1 | NPPC/bandwidth | MIT | [
"agentic_trivial",
"np_search"
] | Undirected graph with 6 vertices labelled 0..5 and 5 edges:
[[0, 2], [1, 2], [2, 3], [3, 5], [4, 5]]
Find a linear layout of bandwidth at most 3: assign to each vertex v a distinct position p[v] in 0..5 (a permutation) such that |p[u] - p[v]| <= 3 for every edge (u, v).
Answer format: {"layout": [p_0, p_1, ..., p_5]}... | {"num_nodes": 6, "bandwidth": 3, "edges": [[0, 2], [1, 2], [2, 3], [3, 5], [4, 5]], "family": "nppc_bandwidth", "subset": "construct"} | null | null | null | {"layout": [0, 4, 2, 5, 1, 3]} | 1 |
construct-nppc-bandwidth-l1-s7 | construct | nppc_bandwidth | graph_bandwidth | graph_theory | competition | 1 | NPPC/bandwidth | MIT | [
"agentic_trivial",
"np_search"
] | Undirected graph with 6 vertices labelled 0..5 and 5 edges:
[[0, 2], [1, 3], [2, 3], [3, 4], [4, 5]]
Find a linear layout of bandwidth at most 3: assign to each vertex v a distinct position p[v] in 0..5 (a permutation) such that |p[u] - p[v]| <= 3 for every edge (u, v).
Answer format: {"layout": [p_0, p_1, ..., p_5]}... | {"num_nodes": 6, "bandwidth": 3, "edges": [[0, 2], [1, 3], [2, 3], [3, 4], [4, 5]], "family": "nppc_bandwidth", "subset": "construct"} | null | null | null | {"layout": [5, 0, 4, 1, 2, 3]} | 1 |
construct-nppc-bandwidth-l1-s8 | construct | nppc_bandwidth | graph_bandwidth | graph_theory | competition | 1 | NPPC/bandwidth | MIT | [
"agentic_trivial",
"np_search"
] | Undirected graph with 6 vertices labelled 0..5 and 5 edges:
[[0, 1], [1, 2], [2, 3], [3, 4], [4, 5]]
Find a linear layout of bandwidth at most 3: assign to each vertex v a distinct position p[v] in 0..5 (a permutation) such that |p[u] - p[v]| <= 3 for every edge (u, v).
Answer format: {"layout": [p_0, p_1, ..., p_5]}... | {"num_nodes": 6, "bandwidth": 3, "edges": [[0, 1], [1, 2], [2, 3], [3, 4], [4, 5]], "family": "nppc_bandwidth", "subset": "construct"} | null | null | null | {"layout": [4, 5, 2, 3, 1, 0]} | 1 |
construct-nppc-bandwidth-l1-s9 | construct | nppc_bandwidth | graph_bandwidth | graph_theory | competition | 1 | NPPC/bandwidth | MIT | [
"agentic_trivial",
"np_search"
] | Undirected graph with 6 vertices labelled 0..5 and 4 edges:
[[0, 1], [1, 2], [2, 3], [3, 4]]
Find a linear layout of bandwidth at most 3: assign to each vertex v a distinct position p[v] in 0..5 (a permutation) such that |p[u] - p[v]| <= 3 for every edge (u, v).
Answer format: {"layout": [p_0, p_1, ..., p_5]} where p... | {"num_nodes": 6, "bandwidth": 3, "edges": [[0, 1], [1, 2], [2, 3], [3, 4]], "family": "nppc_bandwidth", "subset": "construct"} | null | null | null | {"layout": [0, 2, 3, 4, 1, 5]} | 1 |
construct-nppc-bandwidth-l2-s0 | construct | nppc_bandwidth | graph_bandwidth | graph_theory | competition | 2 | NPPC/bandwidth | MIT | [
"agentic_trivial",
"np_search"
] | Undirected graph with 8 vertices labelled 0..7 and 8 edges:
[[0, 1], [1, 2], [1, 3], [2, 4], [3, 4], [3, 7], [4, 5], [5, 7]]
Find a linear layout of bandwidth at most 3: assign to each vertex v a distinct position p[v] in 0..7 (a permutation) such that |p[u] - p[v]| <= 3 for every edge (u, v).
Answer format: {"layout... | {"num_nodes": 8, "bandwidth": 3, "edges": [[0, 1], [1, 2], [1, 3], [2, 4], [3, 4], [3, 7], [4, 5], [5, 7]], "family": "nppc_bandwidth", "subset": "construct"} | null | null | null | {"layout": [0, 3, 1, 5, 4, 6, 2, 7]} | 1 |
construct-nppc-bandwidth-l2-s1 | construct | nppc_bandwidth | graph_bandwidth | graph_theory | competition | 2 | NPPC/bandwidth | MIT | [
"agentic_trivial",
"np_search"
] | Undirected graph with 8 vertices labelled 0..7 and 8 edges:
[[0, 2], [1, 3], [2, 3], [3, 4], [3, 7], [4, 6], [5, 6], [6, 7]]
Find a linear layout of bandwidth at most 3: assign to each vertex v a distinct position p[v] in 0..7 (a permutation) such that |p[u] - p[v]| <= 3 for every edge (u, v).
Answer format: {"layout... | {"num_nodes": 8, "bandwidth": 3, "edges": [[0, 2], [1, 3], [2, 3], [3, 4], [3, 7], [4, 6], [5, 6], [6, 7]], "family": "nppc_bandwidth", "subset": "construct"} | null | null | null | {"layout": [0, 6, 1, 4, 3, 7, 5, 2]} | 1 |
construct-nppc-bandwidth-l2-s2 | construct | nppc_bandwidth | graph_bandwidth | graph_theory | competition | 2 | NPPC/bandwidth | MIT | [
"agentic_trivial",
"np_search"
] | Undirected graph with 8 vertices labelled 0..7 and 8 edges:
[[0, 4], [1, 2], [2, 3], [3, 4], [3, 5], [3, 7], [4, 5], [5, 6]]
Find a linear layout of bandwidth at most 3: assign to each vertex v a distinct position p[v] in 0..7 (a permutation) such that |p[u] - p[v]| <= 3 for every edge (u, v).
Answer format: {"layout... | {"num_nodes": 8, "bandwidth": 3, "edges": [[0, 4], [1, 2], [2, 3], [3, 4], [3, 5], [3, 7], [4, 5], [5, 6]], "family": "nppc_bandwidth", "subset": "construct"} | null | null | null | {"layout": [7, 3, 1, 2, 4, 5, 6, 0]} | 1 |
construct-nppc-bandwidth-l2-s3 | construct | nppc_bandwidth | graph_bandwidth | graph_theory | competition | 2 | NPPC/bandwidth | MIT | [
"agentic_trivial",
"np_search"
] | Undirected graph with 8 vertices labelled 0..7 and 8 edges:
[[0, 1], [0, 2], [1, 2], [2, 5], [3, 4], [4, 6], [5, 7], [6, 7]]
Find a linear layout of bandwidth at most 3: assign to each vertex v a distinct position p[v] in 0..7 (a permutation) such that |p[u] - p[v]| <= 3 for every edge (u, v).
Answer format: {"layout... | {"num_nodes": 8, "bandwidth": 3, "edges": [[0, 1], [0, 2], [1, 2], [2, 5], [3, 4], [4, 6], [5, 7], [6, 7]], "family": "nppc_bandwidth", "subset": "construct"} | null | null | null | {"layout": [1, 4, 2, 7, 6, 0, 5, 3]} | 1 |
construct-nppc-bandwidth-l2-s4 | construct | nppc_bandwidth | graph_bandwidth | graph_theory | competition | 2 | NPPC/bandwidth | MIT | [
"agentic_trivial",
"np_search"
] | Undirected graph with 8 vertices labelled 0..7 and 8 edges:
[[0, 1], [1, 2], [2, 4], [3, 4], [3, 6], [4, 5], [4, 7], [5, 6]]
Find a linear layout of bandwidth at most 3: assign to each vertex v a distinct position p[v] in 0..7 (a permutation) such that |p[u] - p[v]| <= 3 for every edge (u, v).
Answer format: {"layout... | {"num_nodes": 8, "bandwidth": 3, "edges": [[0, 1], [1, 2], [2, 4], [3, 4], [3, 6], [4, 5], [4, 7], [5, 6]], "family": "nppc_bandwidth", "subset": "construct"} | null | null | null | {"layout": [4, 7, 5, 1, 3, 0, 2, 6]} | 1 |
construct-nppc-bandwidth-l2-s5 | construct | nppc_bandwidth | graph_bandwidth | graph_theory | competition | 2 | NPPC/bandwidth | MIT | [
"agentic_trivial",
"np_search"
] | Undirected graph with 8 vertices labelled 0..7 and 8 edges:
[[0, 1], [1, 3], [2, 4], [3, 6], [4, 5], [4, 7], [5, 6], [6, 7]]
Find a linear layout of bandwidth at most 3: assign to each vertex v a distinct position p[v] in 0..7 (a permutation) such that |p[u] - p[v]| <= 3 for every edge (u, v).
Answer format: {"layout... | {"num_nodes": 8, "bandwidth": 3, "edges": [[0, 1], [1, 3], [2, 4], [3, 6], [4, 5], [4, 7], [5, 6], [6, 7]], "family": "nppc_bandwidth", "subset": "construct"} | null | null | null | {"layout": [4, 6, 0, 7, 1, 3, 5, 2]} | 1 |
construct-nppc-bandwidth-l2-s6 | construct | nppc_bandwidth | graph_bandwidth | graph_theory | competition | 2 | NPPC/bandwidth | MIT | [
"agentic_trivial",
"np_search"
] | Undirected graph with 8 vertices labelled 0..7 and 8 edges:
[[0, 5], [0, 7], [1, 2], [2, 3], [3, 4], [4, 5], [5, 6], [6, 7]]
Find a linear layout of bandwidth at most 3: assign to each vertex v a distinct position p[v] in 0..7 (a permutation) such that |p[u] - p[v]| <= 3 for every edge (u, v).
Answer format: {"layout... | {"num_nodes": 8, "bandwidth": 3, "edges": [[0, 5], [0, 7], [1, 2], [2, 3], [3, 4], [4, 5], [5, 6], [6, 7]], "family": "nppc_bandwidth", "subset": "construct"} | null | null | null | {"layout": [0, 4, 6, 7, 5, 2, 1, 3]} | 1 |
construct-nppc-bandwidth-l2-s7 | construct | nppc_bandwidth | graph_bandwidth | graph_theory | competition | 2 | NPPC/bandwidth | MIT | [
"agentic_trivial",
"np_search"
] | Undirected graph with 8 vertices labelled 0..7 and 8 edges:
[[0, 1], [1, 5], [2, 3], [3, 4], [3, 5], [4, 5], [5, 7], [6, 7]]
Find a linear layout of bandwidth at most 3: assign to each vertex v a distinct position p[v] in 0..7 (a permutation) such that |p[u] - p[v]| <= 3 for every edge (u, v).
Answer format: {"layout... | {"num_nodes": 8, "bandwidth": 3, "edges": [[0, 1], [1, 5], [2, 3], [3, 4], [3, 5], [4, 5], [5, 7], [6, 7]], "family": "nppc_bandwidth", "subset": "construct"} | null | null | null | {"layout": [5, 6, 0, 2, 1, 3, 7, 4]} | 1 |
construct-nppc-bandwidth-l2-s8 | construct | nppc_bandwidth | graph_bandwidth | graph_theory | competition | 2 | NPPC/bandwidth | MIT | [
"agentic_trivial",
"np_search"
] | Undirected graph with 8 vertices labelled 0..7 and 8 edges:
[[0, 3], [1, 2], [2, 3], [3, 4], [3, 5], [4, 5], [5, 6], [6, 7]]
Find a linear layout of bandwidth at most 3: assign to each vertex v a distinct position p[v] in 0..7 (a permutation) such that |p[u] - p[v]| <= 3 for every edge (u, v).
Answer format: {"layout... | {"num_nodes": 8, "bandwidth": 3, "edges": [[0, 3], [1, 2], [2, 3], [3, 4], [3, 5], [4, 5], [5, 6], [6, 7]], "family": "nppc_bandwidth", "subset": "construct"} | null | null | null | {"layout": [1, 7, 5, 4, 6, 3, 0, 2]} | 1 |
construct-nppc-bandwidth-l2-s9 | construct | nppc_bandwidth | graph_bandwidth | graph_theory | competition | 2 | NPPC/bandwidth | MIT | [
"agentic_trivial",
"np_search"
] | Undirected graph with 8 vertices labelled 0..7 and 8 edges:
[[0, 2], [0, 4], [1, 3], [2, 4], [3, 4], [3, 6], [4, 5], [5, 6]]
Find a linear layout of bandwidth at most 3: assign to each vertex v a distinct position p[v] in 0..7 (a permutation) such that |p[u] - p[v]| <= 3 for every edge (u, v).
Answer format: {"layout... | {"num_nodes": 8, "bandwidth": 3, "edges": [[0, 2], [0, 4], [1, 3], [2, 4], [3, 4], [3, 6], [4, 5], [5, 6]], "family": "nppc_bandwidth", "subset": "construct"} | null | null | null | {"layout": [2, 7, 1, 5, 4, 3, 6, 0]} | 1 |
construct-nppc-bandwidth-l3-s0 | construct | nppc_bandwidth | graph_bandwidth | graph_theory | competition | 3 | NPPC/bandwidth | MIT | [
"agentic_trivial",
"np_search"
] | Undirected graph with 8 vertices labelled 0..7 and 8 edges:
[[0, 2], [1, 3], [2, 4], [2, 5], [3, 6], [4, 5], [5, 6], [6, 7]]
Find a linear layout of bandwidth at most 2: assign to each vertex v a distinct position p[v] in 0..7 (a permutation) such that |p[u] - p[v]| <= 2 for every edge (u, v).
Answer format: {"layout... | {"num_nodes": 8, "bandwidth": 2, "edges": [[0, 2], [1, 3], [2, 4], [2, 5], [3, 6], [4, 5], [5, 6], [6, 7]], "family": "nppc_bandwidth", "subset": "construct"} | null | null | null | {"layout": [0, 4, 1, 6, 2, 3, 5, 7]} | 1 |
construct-nppc-bandwidth-l3-s1 | construct | nppc_bandwidth | graph_bandwidth | graph_theory | competition | 3 | NPPC/bandwidth | MIT | [
"agentic_trivial",
"np_search"
] | Undirected graph with 8 vertices labelled 0..7 and 8 edges:
[[0, 2], [0, 4], [1, 2], [2, 3], [3, 7], [4, 5], [5, 6], [6, 7]]
Find a linear layout of bandwidth at most 2: assign to each vertex v a distinct position p[v] in 0..7 (a permutation) such that |p[u] - p[v]| <= 2 for every edge (u, v).
Answer format: {"layout... | {"num_nodes": 8, "bandwidth": 2, "edges": [[0, 2], [0, 4], [1, 2], [2, 3], [3, 7], [4, 5], [5, 6], [6, 7]], "family": "nppc_bandwidth", "subset": "construct"} | null | null | null | {"layout": [3, 0, 1, 2, 5, 7, 6, 4]} | 1 |
construct-nppc-bandwidth-l3-s2 | construct | nppc_bandwidth | graph_bandwidth | graph_theory | competition | 3 | NPPC/bandwidth | MIT | [
"agentic_trivial",
"np_search"
] | Undirected graph with 8 vertices labelled 0..7 and 8 edges:
[[0, 2], [0, 3], [1, 3], [2, 7], [3, 4], [3, 6], [4, 7], [5, 6]]
Find a linear layout of bandwidth at most 2: assign to each vertex v a distinct position p[v] in 0..7 (a permutation) such that |p[u] - p[v]| <= 2 for every edge (u, v).
Answer format: {"layout... | {"num_nodes": 8, "bandwidth": 2, "edges": [[0, 2], [0, 3], [1, 3], [2, 7], [3, 4], [3, 6], [4, 7], [5, 6]], "family": "nppc_bandwidth", "subset": "construct"} | null | null | null | {"layout": [2, 5, 0, 4, 3, 7, 6, 1]} | 1 |
construct-nppc-bandwidth-l3-s3 | construct | nppc_bandwidth | graph_bandwidth | graph_theory | competition | 3 | NPPC/bandwidth | MIT | [
"agentic_trivial",
"np_search"
] | Undirected graph with 8 vertices labelled 0..7 and 8 edges:
[[0, 2], [0, 4], [1, 3], [2, 4], [2, 5], [3, 7], [5, 6], [6, 7]]
Find a linear layout of bandwidth at most 2: assign to each vertex v a distinct position p[v] in 0..7 (a permutation) such that |p[u] - p[v]| <= 2 for every edge (u, v).
Answer format: {"layout... | {"num_nodes": 8, "bandwidth": 2, "edges": [[0, 2], [0, 4], [1, 3], [2, 4], [2, 5], [3, 7], [5, 6], [6, 7]], "family": "nppc_bandwidth", "subset": "construct"} | null | null | null | {"layout": [6, 2, 5, 0, 7, 4, 3, 1]} | 1 |
construct-nppc-bandwidth-l3-s4 | construct | nppc_bandwidth | graph_bandwidth | graph_theory | competition | 3 | NPPC/bandwidth | MIT | [
"agentic_trivial",
"np_search"
] | Undirected graph with 8 vertices labelled 0..7 and 8 edges:
[[0, 1], [0, 5], [1, 5], [2, 5], [3, 4], [4, 6], [5, 7], [6, 7]]
Find a linear layout of bandwidth at most 2: assign to each vertex v a distinct position p[v] in 0..7 (a permutation) such that |p[u] - p[v]| <= 2 for every edge (u, v).
Answer format: {"layout... | {"num_nodes": 8, "bandwidth": 2, "edges": [[0, 1], [0, 5], [1, 5], [2, 5], [3, 4], [4, 6], [5, 7], [6, 7]], "family": "nppc_bandwidth", "subset": "construct"} | null | null | null | {"layout": [6, 4, 7, 0, 1, 5, 2, 3]} | 1 |
construct-nppc-bandwidth-l3-s5 | construct | nppc_bandwidth | graph_bandwidth | graph_theory | competition | 3 | NPPC/bandwidth | MIT | [
"agentic_trivial",
"np_search"
] | Undirected graph with 8 vertices labelled 0..7 and 8 edges:
[[0, 2], [0, 3], [0, 7], [1, 2], [2, 3], [3, 5], [4, 7], [5, 6]]
Find a linear layout of bandwidth at most 2: assign to each vertex v a distinct position p[v] in 0..7 (a permutation) such that |p[u] - p[v]| <= 2 for every edge (u, v).
Answer format: {"layout... | {"num_nodes": 8, "bandwidth": 2, "edges": [[0, 2], [0, 3], [0, 7], [1, 2], [2, 3], [3, 5], [4, 7], [5, 6]], "family": "nppc_bandwidth", "subset": "construct"} | null | null | null | {"layout": [5, 1, 3, 4, 7, 2, 0, 6]} | 1 |
construct-nppc-bandwidth-l3-s6 | construct | nppc_bandwidth | graph_bandwidth | graph_theory | competition | 3 | NPPC/bandwidth | MIT | [
"agentic_trivial",
"np_search"
] | Undirected graph with 8 vertices labelled 0..7 and 8 edges:
[[0, 3], [1, 2], [1, 5], [1, 6], [2, 5], [3, 4], [4, 6], [5, 7]]
Find a linear layout of bandwidth at most 2: assign to each vertex v a distinct position p[v] in 0..7 (a permutation) such that |p[u] - p[v]| <= 2 for every edge (u, v).
Answer format: {"layout... | {"num_nodes": 8, "bandwidth": 2, "edges": [[0, 3], [1, 2], [1, 5], [1, 6], [2, 5], [3, 4], [4, 6], [5, 7]], "family": "nppc_bandwidth", "subset": "construct"} | null | null | null | {"layout": [6, 3, 2, 7, 5, 1, 4, 0]} | 1 |
construct-nppc-bandwidth-l3-s7 | construct | nppc_bandwidth | graph_bandwidth | graph_theory | competition | 3 | NPPC/bandwidth | MIT | [
"agentic_trivial",
"np_search"
] | Undirected graph with 8 vertices labelled 0..7 and 8 edges:
[[0, 4], [1, 2], [1, 7], [2, 3], [2, 7], [3, 7], [4, 5], [5, 6]]
Find a linear layout of bandwidth at most 2: assign to each vertex v a distinct position p[v] in 0..7 (a permutation) such that |p[u] - p[v]| <= 2 for every edge (u, v).
Answer format: {"layout... | {"num_nodes": 8, "bandwidth": 2, "edges": [[0, 4], [1, 2], [1, 7], [2, 3], [2, 7], [3, 7], [4, 5], [5, 6]], "family": "nppc_bandwidth", "subset": "construct"} | null | null | null | {"layout": [7, 3, 2, 0, 6, 4, 5, 1]} | 1 |
construct-nppc-bandwidth-l3-s8 | construct | nppc_bandwidth | graph_bandwidth | graph_theory | competition | 3 | NPPC/bandwidth | MIT | [
"agentic_trivial",
"np_search"
] | Undirected graph with 8 vertices labelled 0..7 and 8 edges:
[[0, 1], [0, 4], [1, 2], [1, 3], [2, 7], [3, 4], [4, 5], [5, 6]]
Find a linear layout of bandwidth at most 2: assign to each vertex v a distinct position p[v] in 0..7 (a permutation) such that |p[u] - p[v]| <= 2 for every edge (u, v).
Answer format: {"layout... | {"num_nodes": 8, "bandwidth": 2, "edges": [[0, 1], [0, 4], [1, 2], [1, 3], [2, 7], [3, 4], [4, 5], [5, 6]], "family": "nppc_bandwidth", "subset": "construct"} | null | null | null | {"layout": [5, 4, 6, 2, 3, 1, 0, 7]} | 1 |
construct-nppc-bandwidth-l3-s9 | construct | nppc_bandwidth | graph_bandwidth | graph_theory | competition | 3 | NPPC/bandwidth | MIT | [
"agentic_trivial",
"np_search"
] | Undirected graph with 8 vertices labelled 0..7 and 8 edges:
[[0, 1], [0, 5], [1, 3], [2, 4], [3, 6], [4, 5], [5, 6], [6, 7]]
Find a linear layout of bandwidth at most 2: assign to each vertex v a distinct position p[v] in 0..7 (a permutation) such that |p[u] - p[v]| <= 2 for every edge (u, v).
Answer format: {"layout... | {"num_nodes": 8, "bandwidth": 2, "edges": [[0, 1], [0, 5], [1, 3], [2, 4], [3, 6], [4, 5], [5, 6], [6, 7]], "family": "nppc_bandwidth", "subset": "construct"} | null | null | null | {"layout": [5, 7, 0, 6, 1, 3, 4, 2]} | 1 |
construct-nppc-bandwidth-l4-s0 | construct | nppc_bandwidth | graph_bandwidth | graph_theory | competition | 4 | NPPC/bandwidth | MIT | [
"agentic_trivial",
"np_search"
] | Undirected graph with 20 vertices labelled 0..19 and 41 edges:
[[0, 2], [0, 7], [0, 12], [0, 18], [0, 19], [1, 3], [1, 8], [1, 14], [1, 17], [2, 7], [2, 12], [3, 8], [3, 14], [3, 16], [3, 19], [4, 5], [4, 11], [5, 6], [5, 9], [5, 11], [5, 13], [6, 9], [6, 15], [7, 12], [7, 18], [8, 10], [9, 10], [9, 13], [9, 14], [9, 1... | {"num_nodes": 20, "bandwidth": 3, "edges": [[0, 2], [0, 7], [0, 12], [0, 18], [0, 19], [1, 3], [1, 8], [1, 14], [1, 17], [2, 7], [2, 12], [3, 8], [3, 14], [3, 16], [3, 19], [4, 5], [4, 11], [5, 6], [5, 9], [5, 11], [5, 13], [6, 9], [6, 15], [7, 12], [7, 18], [8, 10], [9, 10], [9, 13], [9, 14], [9, 15], [10, 14], [11, 1... | null | null | null | {"layout": [17, 10, 19, 11, 0, 2, 4, 18, 9, 5, 7, 1, 16, 3, 8, 6, 12, 13, 15, 14]} | 1 |
construct-nppc-bandwidth-l4-s1 | construct | nppc_bandwidth | graph_bandwidth | graph_theory | competition | 4 | NPPC/bandwidth | MIT | [
"agentic_trivial",
"np_search"
] | Undirected graph with 20 vertices labelled 0..19 and 40 edges:
[[0, 4], [0, 6], [0, 7], [0, 8], [0, 12], [0, 16], [1, 2], [1, 15], [1, 19], [2, 13], [2, 15], [3, 5], [3, 8], [3, 11], [4, 6], [4, 8], [4, 12], [4, 16], [4, 18], [5, 11], [6, 8], [6, 11], [7, 10], [7, 12], [7, 19], [8, 11], [9, 13], [9, 14], [9, 17], [9, 1... | {"num_nodes": 20, "bandwidth": 3, "edges": [[0, 4], [0, 6], [0, 7], [0, 8], [0, 12], [0, 16], [1, 2], [1, 15], [1, 19], [2, 13], [2, 15], [3, 5], [3, 8], [3, 11], [4, 6], [4, 8], [4, 12], [4, 16], [4, 18], [5, 11], [6, 8], [6, 11], [7, 10], [7, 12], [7, 19], [8, 11], [9, 13], [9, 14], [9, 17], [9, 19], [10, 12], [10, 1... | null | null | null | {"layout": [12, 3, 0, 18, 13, 19, 14, 9, 15, 4, 8, 17, 11, 2, 7, 1, 10, 5, 16, 6]} | 1 |
construct-nppc-bandwidth-l4-s2 | construct | nppc_bandwidth | graph_bandwidth | graph_theory | competition | 4 | NPPC/bandwidth | MIT | [
"agentic_trivial",
"np_search"
] | Undirected graph with 20 vertices labelled 0..19 and 40 edges:
[[0, 3], [0, 4], [0, 5], [0, 9], [1, 6], [1, 12], [1, 17], [1, 18], [2, 16], [2, 17], [2, 18], [3, 5], [4, 5], [4, 7], [4, 9], [4, 13], [5, 7], [6, 8], [6, 11], [6, 19], [7, 9], [7, 10], [7, 13], [8, 12], [8, 16], [8, 18], [8, 19], [9, 13], [10, 11], [10, 1... | {"num_nodes": 20, "bandwidth": 3, "edges": [[0, 3], [0, 4], [0, 5], [0, 9], [1, 6], [1, 12], [1, 17], [1, 18], [2, 16], [2, 17], [2, 18], [3, 5], [4, 5], [4, 7], [4, 9], [4, 13], [5, 7], [6, 8], [6, 11], [6, 19], [7, 9], [7, 10], [7, 13], [8, 12], [8, 16], [8, 18], [8, 19], [9, 13], [10, 11], [10, 19], [11, 12], [11, 1... | null | null | null | {"layout": [1, 15, 19, 0, 4, 2, 12, 5, 14, 3, 8, 10, 13, 6, 9, 7, 17, 18, 16, 11]} | 1 |
construct-nppc-bandwidth-l4-s3 | construct | nppc_bandwidth | graph_bandwidth | graph_theory | competition | 4 | NPPC/bandwidth | MIT | [
"agentic_trivial",
"np_search"
] | Undirected graph with 20 vertices labelled 0..19 and 44 edges:
[[0, 3], [1, 4], [1, 7], [1, 8], [1, 11], [1, 15], [2, 13], [2, 17], [3, 12], [3, 14], [4, 5], [4, 8], [4, 11], [4, 18], [5, 7], [5, 11], [5, 15], [5, 16], [6, 9], [6, 12], [6, 14], [6, 18], [6, 19], [7, 8], [7, 10], [7, 18], [8, 9], [8, 10], [9, 10], [9, 1... | {"num_nodes": 20, "bandwidth": 3, "edges": [[0, 3], [1, 4], [1, 7], [1, 8], [1, 11], [1, 15], [2, 13], [2, 17], [3, 12], [3, 14], [4, 5], [4, 8], [4, 11], [4, 18], [5, 7], [5, 11], [5, 15], [5, 16], [6, 9], [6, 12], [6, 14], [6, 18], [6, 19], [7, 8], [7, 10], [7, 18], [8, 9], [8, 10], [9, 10], [9, 12], [9, 19], [10, 18... | null | null | null | {"layout": [18, 7, 0, 19, 8, 6, 14, 9, 10, 13, 12, 5, 16, 2, 17, 4, 3, 1, 11, 15]} | 1 |
construct-nppc-bandwidth-l4-s4 | construct | nppc_bandwidth | graph_bandwidth | graph_theory | competition | 4 | NPPC/bandwidth | MIT | [
"agentic_trivial",
"np_search"
] | Undirected graph with 20 vertices labelled 0..19 and 46 edges:
[[0, 9], [0, 15], [1, 5], [1, 6], [1, 9], [1, 18], [2, 3], [2, 5], [2, 12], [2, 14], [2, 17], [3, 7], [3, 13], [3, 14], [3, 16], [4, 7], [4, 8], [5, 10], [5, 16], [5, 19], [6, 9], [6, 10], [6, 11], [6, 18], [6, 19], [7, 8], [7, 13], [7, 14], [8, 13], [8, 14... | {"num_nodes": 20, "bandwidth": 3, "edges": [[0, 9], [0, 15], [1, 5], [1, 6], [1, 9], [1, 18], [2, 3], [2, 5], [2, 12], [2, 14], [2, 17], [3, 7], [3, 13], [3, 14], [3, 16], [4, 7], [4, 8], [5, 10], [5, 16], [5, 19], [6, 9], [6, 10], [6, 11], [6, 18], [6, 19], [7, 8], [7, 13], [7, 14], [8, 13], [8, 14], [9, 11], [9, 15],... | null | null | null | {"layout": [19, 13, 7, 5, 0, 10, 14, 3, 1, 16, 12, 17, 6, 2, 4, 18, 8, 9, 15, 11]} | 1 |
construct-nppc-bandwidth-l4-s5 | construct | nppc_bandwidth | graph_bandwidth | graph_theory | competition | 4 | NPPC/bandwidth | MIT | [
"agentic_trivial",
"np_search"
] | Undirected graph with 20 vertices labelled 0..19 and 41 edges:
[[0, 3], [0, 13], [0, 18], [1, 4], [1, 8], [1, 12], [1, 14], [1, 17], [2, 5], [2, 7], [2, 11], [2, 16], [2, 19], [3, 10], [3, 18], [4, 12], [4, 14], [4, 17], [5, 6], [5, 7], [5, 10], [5, 19], [6, 7], [6, 10], [6, 15], [7, 8], [7, 11], [7, 19], [8, 9], [8, 1... | {"num_nodes": 20, "bandwidth": 3, "edges": [[0, 3], [0, 13], [0, 18], [1, 4], [1, 8], [1, 12], [1, 14], [1, 17], [2, 5], [2, 7], [2, 11], [2, 16], [2, 19], [3, 10], [3, 18], [4, 12], [4, 14], [4, 17], [5, 6], [5, 7], [5, 10], [5, 19], [6, 7], [6, 10], [6, 15], [7, 8], [7, 11], [7, 19], [8, 9], [8, 11], [8, 17], [9, 11]... | null | null | null | {"layout": [1, 16, 9, 2, 18, 8, 7, 10, 13, 14, 5, 12, 17, 0, 19, 4, 6, 15, 3, 11]} | 1 |
construct-nppc-bandwidth-l4-s6 | construct | nppc_bandwidth | graph_bandwidth | graph_theory | competition | 4 | NPPC/bandwidth | MIT | [
"agentic_trivial",
"np_search"
] | Undirected graph with 20 vertices labelled 0..19 and 40 edges:
[[0, 3], [0, 4], [0, 8], [0, 9], [1, 5], [1, 12], [1, 17], [1, 18], [2, 3], [2, 8], [2, 14], [3, 4], [3, 8], [3, 15], [3, 19], [4, 8], [4, 9], [4, 15], [5, 6], [5, 11], [5, 14], [5, 16], [6, 7], [6, 12], [6, 17], [7, 12], [7, 13], [7, 17], [7, 18], [8, 9], ... | {"num_nodes": 20, "bandwidth": 3, "edges": [[0, 3], [0, 4], [0, 8], [0, 9], [1, 5], [1, 12], [1, 17], [1, 18], [2, 3], [2, 8], [2, 14], [3, 4], [3, 8], [3, 15], [3, 19], [4, 8], [4, 9], [4, 15], [5, 6], [5, 11], [5, 14], [5, 16], [6, 7], [6, 12], [6, 17], [7, 12], [7, 13], [7, 17], [7, 18], [8, 9], [10, 12], [10, 13], ... | null | null | null | {"layout": [1, 14, 6, 4, 2, 11, 13, 15, 3, 0, 19, 10, 16, 18, 8, 5, 9, 12, 17, 7]} | 1 |
construct-nppc-bandwidth-l4-s7 | construct | nppc_bandwidth | graph_bandwidth | graph_theory | competition | 4 | NPPC/bandwidth | MIT | [
"agentic_trivial",
"np_search"
] | Undirected graph with 20 vertices labelled 0..19 and 38 edges:
[[0, 4], [0, 9], [0, 19], [1, 3], [1, 7], [1, 14], [1, 15], [1, 16], [2, 11], [2, 14], [3, 5], [3, 15], [3, 18], [4, 5], [4, 9], [4, 19], [5, 8], [5, 15], [5, 18], [6, 10], [6, 12], [7, 13], [7, 15], [8, 9], [8, 15], [8, 16], [8, 18], [9, 12], [9, 18], [10,... | {"num_nodes": 20, "bandwidth": 3, "edges": [[0, 4], [0, 9], [0, 19], [1, 3], [1, 7], [1, 14], [1, 15], [1, 16], [2, 11], [2, 14], [3, 5], [3, 15], [3, 18], [4, 5], [4, 9], [4, 19], [5, 8], [5, 15], [5, 18], [6, 10], [6, 12], [7, 13], [7, 15], [8, 9], [8, 15], [8, 16], [8, 18], [9, 12], [9, 18], [10, 19], [11, 14], [11,... | null | null | null | {"layout": [3, 13, 18, 10, 5, 8, 1, 14, 9, 6, 0, 19, 4, 15, 16, 11, 12, 17, 7, 2]} | 1 |
construct-nppc-bandwidth-l4-s8 | construct | nppc_bandwidth | graph_bandwidth | graph_theory | competition | 4 | NPPC/bandwidth | MIT | [
"agentic_trivial",
"np_search"
] | Undirected graph with 20 vertices labelled 0..19 and 39 edges:
[[0, 8], [0, 9], [1, 3], [1, 6], [1, 11], [1, 12], [1, 18], [2, 5], [2, 10], [2, 17], [2, 19], [3, 6], [3, 16], [4, 5], [4, 10], [5, 7], [5, 10], [5, 17], [6, 11], [6, 12], [6, 18], [6, 19], [7, 10], [7, 12], [7, 14], [8, 9], [8, 16], [9, 13], [9, 16], [10,... | {"num_nodes": 20, "bandwidth": 3, "edges": [[0, 8], [0, 9], [1, 3], [1, 6], [1, 11], [1, 12], [1, 18], [2, 5], [2, 10], [2, 17], [2, 19], [3, 6], [3, 16], [4, 5], [4, 10], [5, 7], [5, 10], [5, 17], [6, 11], [6, 12], [6, 18], [6, 19], [7, 10], [7, 12], [7, 14], [8, 9], [8, 16], [9, 13], [9, 16], [10, 14], [11, 13], [11,... | null | null | null | {"layout": [0, 8, 15, 7, 19, 17, 9, 14, 1, 2, 16, 6, 11, 5, 13, 3, 4, 18, 10, 12]} | 1 |
construct-nppc-bandwidth-l4-s9 | construct | nppc_bandwidth | graph_bandwidth | graph_theory | competition | 4 | NPPC/bandwidth | MIT | [
"agentic_trivial",
"np_search"
] | Undirected graph with 20 vertices labelled 0..19 and 46 edges:
[[0, 2], [0, 3], [0, 4], [0, 11], [0, 19], [1, 9], [1, 10], [1, 14], [2, 3], [2, 4], [2, 12], [2, 16], [2, 17], [3, 4], [3, 16], [3, 19], [4, 11], [4, 16], [4, 19], [5, 7], [5, 11], [5, 15], [5, 18], [6, 9], [6, 12], [6, 13], [7, 8], [7, 11], [7, 18], [7, 1... | {"num_nodes": 20, "bandwidth": 3, "edges": [[0, 2], [0, 3], [0, 4], [0, 11], [0, 19], [1, 9], [1, 10], [1, 14], [2, 3], [2, 4], [2, 12], [2, 16], [2, 17], [3, 4], [3, 16], [3, 19], [4, 11], [4, 16], [4, 19], [5, 7], [5, 11], [5, 15], [5, 18], [6, 9], [6, 12], [6, 13], [7, 8], [7, 11], [7, 18], [7, 19], [8, 11], [8, 15]... | null | null | null | {"layout": [7, 19, 10, 9, 8, 3, 14, 4, 2, 17, 16, 5, 12, 15, 18, 0, 11, 13, 1, 6]} | 1 |
construct-nppc-bandwidth-l5-s0 | construct | nppc_bandwidth | graph_bandwidth | graph_theory | competition | 5 | NPPC/bandwidth | MIT | [
"agentic_trivial",
"np_search"
] | Undirected graph with 40 vertices labelled 0..39 and 100 edges:
[[0, 15], [0, 28], [0, 30], [0, 33], [0, 34], [0, 38], [1, 2], [1, 8], [1, 10], [1, 11], [2, 3], [2, 8], [2, 10], [2, 18], [2, 22], [3, 9], [3, 16], [4, 5], [4, 7], [4, 20], [4, 26], [4, 32], [5, 7], [5, 17], [5, 25], [5, 26], [5, 32], [6, 8], [6, 10], [6,... | {"num_nodes": 40, "bandwidth": 4, "edges": [[0, 15], [0, 28], [0, 30], [0, 33], [0, 34], [0, 38], [1, 2], [1, 8], [1, 10], [1, 11], [2, 3], [2, 8], [2, 10], [2, 18], [2, 22], [3, 9], [3, 16], [4, 5], [4, 7], [4, 20], [4, 26], [4, 32], [5, 7], [5, 17], [5, 25], [5, 26], [5, 32], [6, 8], [6, 10], [6, 15], [6, 22], [7, 25... | null | null | null | {"layout": [3, 13, 12, 16, 34, 36, 10, 37, 9, 18, 11, 17, 27, 29, 28, 7, 15, 32, 8, 30, 31, 25, 14, 24, 23, 38, 33, 20, 5, 19, 4, 39, 35, 1, 2, 21, 22, 0, 6, 26]} | 1 |
construct-nppc-bandwidth-l5-s1 | construct | nppc_bandwidth | graph_bandwidth | graph_theory | competition | 5 | NPPC/bandwidth | MIT | [
"agentic_trivial",
"np_search"
] | Undirected graph with 40 vertices labelled 0..39 and 101 edges:
[[0, 1], [0, 20], [0, 32], [0, 39], [1, 4], [2, 8], [2, 11], [2, 30], [2, 33], [3, 9], [3, 13], [3, 19], [3, 21], [3, 31], [3, 35], [4, 10], [4, 20], [4, 39], [5, 8], [5, 12], [5, 17], [5, 22], [6, 12], [6, 26], [6, 27], [6, 28], [6, 34], [7, 11], [7, 15],... | {"num_nodes": 40, "bandwidth": 4, "edges": [[0, 1], [0, 20], [0, 32], [0, 39], [1, 4], [2, 8], [2, 11], [2, 30], [2, 33], [3, 9], [3, 13], [3, 19], [3, 21], [3, 31], [3, 35], [4, 10], [4, 20], [4, 39], [5, 8], [5, 12], [5, 17], [5, 22], [6, 12], [6, 26], [6, 27], [6, 28], [6, 34], [7, 11], [7, 15], [7, 21], [7, 25], [7... | null | null | null | {"layout": [4, 0, 24, 11, 1, 30, 37, 17, 27, 7, 2, 21, 34, 13, 23, 16, 35, 28, 32, 9, 5, 15, 29, 25, 18, 19, 39, 36, 33, 31, 26, 10, 6, 22, 38, 12, 8, 14, 20, 3]} | 1 |
construct-nppc-bandwidth-l5-s2 | construct | nppc_bandwidth | graph_bandwidth | graph_theory | competition | 5 | NPPC/bandwidth | MIT | [
"agentic_trivial",
"np_search"
] | Undirected graph with 40 vertices labelled 0..39 and 104 edges:
[[0, 7], [0, 15], [0, 16], [0, 39], [1, 2], [1, 3], [1, 5], [1, 19], [1, 23], [1, 37], [2, 4], [2, 5], [2, 32], [2, 37], [3, 5], [3, 8], [3, 19], [3, 20], [3, 30], [4, 5], [4, 17], [4, 27], [4, 32], [4, 34], [4, 37], [5, 8], [5, 23], [5, 27], [6, 10], [6, ... | {"num_nodes": 40, "bandwidth": 4, "edges": [[0, 7], [0, 15], [0, 16], [0, 39], [1, 2], [1, 3], [1, 5], [1, 19], [1, 23], [1, 37], [2, 4], [2, 5], [2, 32], [2, 37], [3, 5], [3, 8], [3, 19], [3, 20], [3, 30], [4, 5], [4, 17], [4, 27], [4, 32], [4, 34], [4, 37], [5, 8], [5, 23], [5, 27], [6, 10], [6, 13], [6, 22], [6, 26]... | null | null | null | {"layout": [39, 19, 22, 16, 24, 20, 2, 38, 18, 11, 6, 27, 8, 3, 5, 37, 35, 28, 31, 15, 13, 7, 4, 17, 14, 30, 0, 21, 1, 29, 12, 32, 26, 10, 25, 34, 33, 23, 9, 36]} | 1 |
construct-nppc-bandwidth-l5-s3 | construct | nppc_bandwidth | graph_bandwidth | graph_theory | competition | 5 | NPPC/bandwidth | MIT | [
"agentic_trivial",
"np_search"
] | Undirected graph with 40 vertices labelled 0..39 and 111 edges:
[[0, 6], [0, 8], [1, 9], [1, 12], [1, 13], [1, 28], [1, 33], [2, 3], [2, 11], [2, 16], [2, 24], [2, 39], [3, 7], [3, 9], [3, 16], [3, 24], [3, 29], [3, 38], [4, 6], [4, 8], [4, 16], [4, 32], [5, 17], [5, 23], [5, 25], [5, 26], [5, 28], [5, 31], [5, 37], [6... | {"num_nodes": 40, "bandwidth": 4, "edges": [[0, 6], [0, 8], [1, 9], [1, 12], [1, 13], [1, 28], [1, 33], [2, 3], [2, 11], [2, 16], [2, 24], [2, 39], [3, 7], [3, 9], [3, 16], [3, 24], [3, 29], [3, 38], [4, 6], [4, 8], [4, 16], [4, 32], [5, 17], [5, 23], [5, 25], [5, 26], [5, 28], [5, 31], [5, 37], [6, 8], [6, 11], [6, 14... | null | null | null | {"layout": [36, 19, 29, 25, 31, 11, 35, 24, 33, 22, 18, 32, 20, 17, 37, 39, 27, 8, 0, 2, 6, 16, 1, 13, 26, 14, 7, 5, 15, 21, 38, 10, 34, 23, 9, 3, 4, 12, 28, 30]} | 1 |
construct-nppc-bandwidth-l5-s4 | construct | nppc_bandwidth | graph_bandwidth | graph_theory | competition | 5 | NPPC/bandwidth | MIT | [
"agentic_trivial",
"np_search"
] | Undirected graph with 40 vertices labelled 0..39 and 104 edges:
[[0, 11], [0, 21], [0, 22], [0, 32], [0, 37], [1, 4], [1, 9], [1, 15], [1, 24], [1, 27], [2, 5], [2, 8], [2, 9], [2, 19], [2, 24], [2, 27], [3, 14], [3, 28], [4, 15], [4, 16], [4, 31], [4, 34], [4, 37], [5, 7], [5, 8], [5, 25], [6, 8], [6, 9], [6, 24], [6,... | {"num_nodes": 40, "bandwidth": 4, "edges": [[0, 11], [0, 21], [0, 22], [0, 32], [0, 37], [1, 4], [1, 9], [1, 15], [1, 24], [1, 27], [2, 5], [2, 8], [2, 9], [2, 19], [2, 24], [2, 27], [3, 14], [3, 28], [4, 15], [4, 16], [4, 31], [4, 34], [4, 37], [5, 7], [5, 8], [5, 25], [6, 8], [6, 9], [6, 24], [6, 27], [6, 34], [7, 13... | null | null | null | {"layout": [31, 21, 15, 38, 25, 13, 20, 11, 16, 19, 1, 32, 30, 8, 36, 24, 23, 39, 9, 12, 6, 27, 29, 0, 17, 14, 37, 18, 35, 7, 34, 26, 33, 2, 22, 10, 4, 28, 3, 5]} | 1 |
construct-nppc-bandwidth-l5-s5 | construct | nppc_bandwidth | graph_bandwidth | graph_theory | competition | 5 | NPPC/bandwidth | MIT | [
"agentic_trivial",
"np_search"
] | Undirected graph with 40 vertices labelled 0..39 and 106 edges:
[[0, 2], [0, 5], [0, 19], [0, 22], [0, 24], [0, 35], [1, 6], [1, 10], [1, 11], [1, 12], [1, 28], [1, 32], [2, 3], [2, 20], [2, 30], [2, 35], [2, 36], [3, 15], [3, 36], [4, 7], [5, 10], [5, 15], [5, 22], [6, 9], [6, 11], [6, 14], [6, 16], [6, 28], [6, 32], ... | {"num_nodes": 40, "bandwidth": 4, "edges": [[0, 2], [0, 5], [0, 19], [0, 22], [0, 24], [0, 35], [1, 6], [1, 10], [1, 11], [1, 12], [1, 28], [1, 32], [2, 3], [2, 20], [2, 30], [2, 35], [2, 36], [3, 15], [3, 36], [4, 7], [5, 10], [5, 15], [5, 22], [6, 9], [6, 11], [6, 14], [6, 16], [6, 28], [6, 32], [7, 9], [7, 16], [8, ... | null | null | null | {"layout": [20, 30, 16, 19, 38, 24, 33, 39, 8, 37, 27, 29, 28, 4, 35, 23, 36, 3, 26, 18, 14, 25, 22, 11, 21, 6, 0, 9, 34, 10, 13, 12, 32, 2, 5, 17, 15, 7, 31, 1]} | 1 |
construct-nppc-bandwidth-l5-s6 | construct | nppc_bandwidth | graph_bandwidth | graph_theory | competition | 5 | NPPC/bandwidth | MIT | [
"agentic_trivial",
"np_search"
] | Undirected graph with 40 vertices labelled 0..39 and 106 edges:
[[0, 3], [0, 14], [0, 18], [0, 19], [0, 22], [0, 27], [1, 6], [1, 11], [1, 15], [1, 29], [2, 11], [2, 16], [2, 24], [2, 25], [2, 26], [2, 37], [2, 38], [3, 13], [3, 14], [3, 19], [3, 36], [4, 8], [4, 12], [4, 15], [4, 28], [4, 35], [4, 39], [5, 7], [5, 9],... | {"num_nodes": 40, "bandwidth": 4, "edges": [[0, 3], [0, 14], [0, 18], [0, 19], [0, 22], [0, 27], [1, 6], [1, 11], [1, 15], [1, 29], [2, 11], [2, 16], [2, 24], [2, 25], [2, 26], [2, 37], [2, 38], [3, 13], [3, 14], [3, 19], [3, 36], [4, 8], [4, 12], [4, 15], [4, 28], [4, 35], [4, 39], [5, 7], [5, 9], [5, 21], [5, 23], [5... | null | null | null | {"layout": [26, 8, 3, 25, 16, 35, 9, 34, 13, 31, 20, 7, 19, 29, 23, 12, 2, 24, 28, 27, 36, 32, 22, 37, 0, 5, 6, 30, 14, 11, 33, 38, 18, 10, 39, 17, 21, 4, 1, 15]} | 1 |
construct-nppc-bandwidth-l5-s7 | construct | nppc_bandwidth | graph_bandwidth | graph_theory | competition | 5 | NPPC/bandwidth | MIT | [
"agentic_trivial",
"np_search"
] | Undirected graph with 40 vertices labelled 0..39 and 102 edges:
[[0, 7], [0, 8], [0, 10], [0, 17], [0, 27], [0, 35], [1, 4], [1, 6], [1, 15], [1, 26], [1, 28], [1, 31], [1, 32], [2, 8], [2, 27], [3, 5], [3, 9], [3, 14], [3, 20], [3, 21], [4, 15], [4, 25], [4, 26], [4, 37], [5, 9], [5, 12], [5, 14], [5, 39], [6, 15], [6... | {"num_nodes": 40, "bandwidth": 4, "edges": [[0, 7], [0, 8], [0, 10], [0, 17], [0, 27], [0, 35], [1, 4], [1, 6], [1, 15], [1, 26], [1, 28], [1, 31], [1, 32], [2, 8], [2, 27], [3, 5], [3, 9], [3, 14], [3, 20], [3, 21], [4, 15], [4, 25], [4, 26], [4, 37], [5, 9], [5, 12], [5, 14], [5, 39], [6, 15], [6, 18], [7, 10], [7, 1... | null | null | null | {"layout": [34, 19, 39, 3, 16, 2, 22, 31, 36, 1, 33, 32, 4, 8, 5, 20, 27, 37, 24, 11, 7, 6, 25, 9, 29, 14, 17, 35, 18, 15, 28, 23, 21, 30, 26, 38, 12, 13, 10, 0]} | 1 |
construct-nppc-bandwidth-l5-s8 | construct | nppc_bandwidth | graph_bandwidth | graph_theory | competition | 5 | NPPC/bandwidth | MIT | [
"agentic_trivial",
"np_search"
] | Undirected graph with 40 vertices labelled 0..39 and 104 edges:
[[0, 1], [0, 6], [0, 13], [0, 34], [1, 6], [1, 10], [2, 5], [2, 7], [2, 8], [2, 9], [2, 18], [2, 23], [2, 34], [3, 11], [3, 27], [3, 30], [3, 38], [4, 10], [4, 14], [4, 24], [4, 25], [4, 29], [4, 37], [5, 8], [5, 12], [5, 33], [6, 9], [6, 13], [6, 25], [6,... | {"num_nodes": 40, "bandwidth": 4, "edges": [[0, 1], [0, 6], [0, 13], [0, 34], [1, 6], [1, 10], [2, 5], [2, 7], [2, 8], [2, 9], [2, 18], [2, 23], [2, 34], [3, 11], [3, 27], [3, 30], [3, 38], [4, 10], [4, 14], [4, 24], [4, 25], [4, 29], [4, 37], [5, 8], [5, 12], [5, 33], [6, 9], [6, 13], [6, 25], [6, 34], [6, 39], [7, 8]... | null | null | null | {"layout": [23, 24, 19, 0, 32, 15, 25, 20, 17, 22, 28, 1, 14, 27, 35, 10, 39, 37, 18, 13, 5, 38, 6, 16, 30, 29, 9, 3, 8, 33, 2, 7, 36, 12, 21, 11, 31, 34, 4, 26]} | 1 |
construct-nppc-bandwidth-l5-s9 | construct | nppc_bandwidth | graph_bandwidth | graph_theory | competition | 5 | NPPC/bandwidth | MIT | [
"agentic_trivial",
"np_search"
] | Undirected graph with 40 vertices labelled 0..39 and 111 edges:
[[0, 2], [0, 9], [0, 26], [0, 30], [1, 7], [1, 14], [1, 37], [1, 38], [1, 39], [2, 7], [2, 9], [2, 13], [2, 26], [2, 28], [2, 30], [3, 4], [3, 16], [3, 19], [3, 21], [3, 34], [4, 16], [4, 19], [4, 23], [4, 31], [4, 34], [5, 6], [5, 24], [6, 20], [6, 22], [... | {"num_nodes": 40, "bandwidth": 4, "edges": [[0, 2], [0, 9], [0, 26], [0, 30], [1, 7], [1, 14], [1, 37], [1, 38], [1, 39], [2, 7], [2, 9], [2, 13], [2, 26], [2, 28], [2, 30], [3, 4], [3, 16], [3, 19], [3, 21], [3, 34], [4, 16], [4, 19], [4, 23], [4, 31], [4, 34], [5, 6], [5, 24], [6, 20], [6, 22], [7, 13], [7, 38], [8, ... | null | null | null | {"layout": [26, 21, 28, 8, 6, 38, 37, 25, 12, 30, 16, 15, 0, 24, 18, 11, 4, 14, 13, 10, 39, 9, 35, 3, 36, 1, 29, 32, 31, 34, 27, 7, 22, 2, 5, 19, 33, 17, 23, 20]} | 1 |
construct-nppc-bandwidth-l6-s0 | construct | nppc_bandwidth | graph_bandwidth | graph_theory | competition | 6 | NPPC/bandwidth | MIT | [
"agentic_trivial",
"np_search"
] | Undirected graph with 80 vertices labelled 0..79 and 224 edges:
[[0, 9], [0, 17], [0, 24], [0, 26], [0, 28], [0, 40], [1, 8], [1, 11], [1, 36], [1, 46], [1, 61], [1, 70], [1, 71], [2, 4], [2, 14], [2, 15], [2, 25], [2, 35], [2, 42], [2, 52], [2, 62], [3, 12], [3, 69], [3, 71], [3, 76], [4, 14], [4, 35], [4, 55], [5, 20... | {"num_nodes": 80, "bandwidth": 5, "edges": [[0, 9], [0, 17], [0, 24], [0, 26], [0, 28], [0, 40], [1, 8], [1, 11], [1, 36], [1, 46], [1, 61], [1, 70], [1, 71], [2, 4], [2, 14], [2, 15], [2, 25], [2, 35], [2, 42], [2, 52], [2, 62], [3, 12], [3, 69], [3, 71], [3, 76], [4, 14], [4, 35], [4, 55], [5, 20], [5, 49], [5, 76], ... | null | null | null | {"layout": [28, 60, 46, 68, 45, 74, 10, 9, 61, 29, 3, 62, 63, 2, 44, 51, 67, 33, 56, 0, 76, 36, 7, 79, 23, 50, 25, 1, 31, 27, 54, 48, 40, 53, 34, 47, 57, 30, 66, 6, 24, 21, 43, 72, 5, 73, 58, 8, 35, 71, 12, 22, 49, 32, 17, 42, 13, 37, 4, 16, 38, 55, 41, 20, 52, 15, 78, 39, 77, 64, 59, 65, 75, 18, 69, 14, 70, 11, 26, 19... | 1 |
construct-nppc-bandwidth-l6-s1 | construct | nppc_bandwidth | graph_bandwidth | graph_theory | competition | 6 | NPPC/bandwidth | MIT | [
"agentic_trivial",
"np_search"
] | Undirected graph with 80 vertices labelled 0..79 and 221 edges:
[[0, 2], [0, 33], [0, 52], [0, 75], [0, 78], [1, 4], [1, 50], [1, 64], [2, 7], [2, 19], [2, 23], [2, 38], [2, 44], [2, 75], [3, 17], [3, 26], [3, 47], [3, 69], [4, 15], [4, 20], [4, 39], [4, 67], [4, 77], [5, 17], [5, 48], [5, 74], [6, 8], [6, 14], [6, 24]... | {"num_nodes": 80, "bandwidth": 5, "edges": [[0, 2], [0, 33], [0, 52], [0, 75], [0, 78], [1, 4], [1, 50], [1, 64], [2, 7], [2, 19], [2, 23], [2, 38], [2, 44], [2, 75], [3, 17], [3, 26], [3, 47], [3, 69], [4, 15], [4, 20], [4, 39], [4, 67], [4, 77], [5, 17], [5, 48], [5, 74], [6, 8], [6, 14], [6, 24], [6, 25], [7, 19], [... | null | null | null | {"layout": [15, 49, 19, 70, 53, 78, 33, 21, 31, 4, 32, 37, 59, 41, 29, 55, 34, 73, 46, 23, 58, 13, 7, 16, 35, 38, 71, 11, 8, 61, 60, 62, 57, 10, 14, 39, 5, 63, 24, 56, 75, 30, 48, 2, 18, 44, 9, 72, 76, 69, 51, 42, 12, 64, 50, 27, 45, 1, 6, 36, 66, 25, 40, 26, 47, 77, 43, 54, 0, 74, 3, 28, 65, 67, 79, 20, 22, 52, 17, 68... | 1 |
construct-nppc-bandwidth-l6-s2 | construct | nppc_bandwidth | graph_bandwidth | graph_theory | competition | 6 | NPPC/bandwidth | MIT | [
"agentic_trivial",
"np_search"
] | Undirected graph with 80 vertices labelled 0..79 and 231 edges:
[[0, 8], [0, 9], [0, 22], [0, 59], [1, 7], [1, 44], [1, 66], [2, 6], [2, 15], [2, 16], [2, 28], [2, 46], [2, 51], [2, 64], [2, 71], [2, 72], [3, 14], [3, 34], [3, 55], [4, 7], [4, 11], [4, 36], [4, 47], [4, 66], [5, 6], [5, 15], [5, 24], [5, 51], [5, 63], ... | {"num_nodes": 80, "bandwidth": 5, "edges": [[0, 8], [0, 9], [0, 22], [0, 59], [1, 7], [1, 44], [1, 66], [2, 6], [2, 15], [2, 16], [2, 28], [2, 46], [2, 51], [2, 64], [2, 71], [2, 72], [3, 14], [3, 34], [3, 55], [4, 7], [4, 11], [4, 36], [4, 47], [4, 66], [5, 6], [5, 15], [5, 24], [5, 51], [5, 63], [5, 78], [6, 15], [6,... | null | null | null | {"layout": [50, 43, 66, 7, 35, 72, 71, 39, 49, 52, 14, 40, 37, 15, 12, 68, 67, 41, 1, 18, 4, 28, 48, 51, 73, 78, 24, 53, 65, 22, 21, 16, 11, 77, 5, 13, 32, 57, 26, 31, 34, 58, 8, 30, 46, 20, 62, 36, 19, 25, 0, 69, 59, 56, 2, 3, 9, 10, 33, 55, 79, 27, 47, 74, 61, 6, 38, 23, 29, 75, 54, 70, 63, 42, 44, 64, 45, 60, 76, 17... | 1 |
construct-nppc-bandwidth-l6-s3 | construct | nppc_bandwidth | graph_bandwidth | graph_theory | competition | 6 | NPPC/bandwidth | MIT | [
"agentic_trivial",
"np_search"
] | Undirected graph with 80 vertices labelled 0..79 and 215 edges:
[[0, 2], [0, 15], [0, 21], [0, 50], [1, 15], [1, 24], [1, 45], [1, 56], [2, 4], [2, 50], [3, 5], [3, 20], [3, 28], [3, 47], [3, 58], [4, 8], [4, 15], [4, 21], [4, 50], [4, 53], [5, 18], [5, 28], [5, 40], [5, 58], [5, 61], [6, 10], [6, 68], [6, 69], [7, 14]... | {"num_nodes": 80, "bandwidth": 5, "edges": [[0, 2], [0, 15], [0, 21], [0, 50], [1, 15], [1, 24], [1, 45], [1, 56], [2, 4], [2, 50], [3, 5], [3, 20], [3, 28], [3, 47], [3, 58], [4, 8], [4, 15], [4, 21], [4, 50], [4, 53], [5, 18], [5, 28], [5, 40], [5, 58], [5, 61], [6, 10], [6, 68], [6, 69], [7, 14], [7, 22], [7, 44], [... | null | null | null | {"layout": [4, 10, 0, 25, 3, 24, 56, 70, 1, 33, 57, 51, 18, 43, 71, 8, 79, 59, 19, 76, 23, 2, 74, 17, 15, 21, 77, 49, 26, 44, 27, 66, 54, 53, 16, 55, 12, 45, 30, 48, 28, 13, 36, 78, 65, 11, 37, 29, 38, 75, 5, 42, 67, 6, 52, 14, 9, 50, 22, 31, 35, 20, 72, 47, 7, 40, 34, 73, 60, 58, 63, 39, 68, 62, 41, 64, 32, 61, 69, 46... | 1 |
construct-nppc-bandwidth-l6-s4 | construct | nppc_bandwidth | graph_bandwidth | graph_theory | competition | 6 | NPPC/bandwidth | MIT | [
"agentic_trivial",
"np_search"
] | Undirected graph with 80 vertices labelled 0..79 and 236 edges:
[[0, 11], [0, 16], [0, 40], [0, 51], [0, 65], [1, 4], [1, 17], [1, 25], [1, 28], [1, 67], [1, 76], [2, 8], [2, 30], [2, 79], [3, 15], [3, 33], [3, 38], [3, 47], [3, 54], [3, 55], [4, 12], [4, 25], [4, 28], [4, 39], [4, 61], [4, 67], [4, 76], [5, 6], [5, 43... | {"num_nodes": 80, "bandwidth": 5, "edges": [[0, 11], [0, 16], [0, 40], [0, 51], [0, 65], [1, 4], [1, 17], [1, 25], [1, 28], [1, 67], [1, 76], [2, 8], [2, 30], [2, 79], [3, 15], [3, 33], [3, 38], [3, 47], [3, 54], [3, 55], [4, 12], [4, 25], [4, 28], [4, 39], [4, 61], [4, 67], [4, 76], [5, 6], [5, 43], [5, 49], [5, 52], ... | null | null | null | {"layout": [76, 65, 42, 9, 64, 21, 25, 70, 40, 29, 53, 79, 69, 37, 28, 5, 73, 66, 10, 26, 46, 30, 51, 74, 38, 60, 36, 23, 62, 14, 39, 56, 2, 12, 18, 15, 47, 33, 4, 59, 75, 50, 16, 20, 3, 0, 22, 8, 52, 17, 31, 77, 24, 55, 7, 6, 44, 41, 71, 1, 57, 68, 49, 54, 58, 72, 45, 67, 35, 48, 34, 63, 27, 19, 78, 32, 61, 13, 11, 43... | 1 |
construct-nppc-bandwidth-l6-s5 | construct | nppc_bandwidth | graph_bandwidth | graph_theory | competition | 6 | NPPC/bandwidth | MIT | [
"agentic_trivial",
"np_search"
] | Undirected graph with 80 vertices labelled 0..79 and 225 edges:
[[0, 5], [0, 20], [0, 30], [0, 55], [0, 60], [0, 71], [0, 73], [1, 9], [1, 12], [1, 53], [1, 67], [2, 13], [2, 25], [2, 52], [2, 56], [3, 7], [3, 8], [3, 42], [3, 51], [4, 8], [4, 14], [4, 31], [4, 41], [4, 48], [4, 49], [4, 74], [5, 6], [5, 22], [5, 38], ... | {"num_nodes": 80, "bandwidth": 5, "edges": [[0, 5], [0, 20], [0, 30], [0, 55], [0, 60], [0, 71], [0, 73], [1, 9], [1, 12], [1, 53], [1, 67], [2, 13], [2, 25], [2, 52], [2, 56], [3, 7], [3, 8], [3, 42], [3, 51], [4, 8], [4, 14], [4, 31], [4, 41], [4, 48], [4, 49], [4, 74], [5, 6], [5, 22], [5, 38], [5, 44], [5, 71], [6,... | null | null | null | {"layout": [30, 78, 60, 43, 50, 34, 36, 41, 47, 73, 68, 67, 75, 65, 51, 72, 22, 56, 21, 4, 28, 19, 39, 16, 55, 58, 25, 70, 8, 7, 26, 53, 79, 18, 3, 12, 64, 71, 37, 44, 11, 49, 38, 10, 35, 20, 15, 14, 46, 52, 54, 40, 62, 77, 9, 27, 63, 69, 0, 23, 31, 24, 32, 48, 59, 61, 42, 76, 74, 57, 5, 33, 13, 29, 45, 2, 6, 66, 1, 17... | 1 |
construct-nppc-bandwidth-l6-s6 | construct | nppc_bandwidth | graph_bandwidth | graph_theory | competition | 6 | NPPC/bandwidth | MIT | [
"agentic_trivial",
"np_search"
] | Undirected graph with 80 vertices labelled 0..79 and 239 edges:
[[0, 1], [0, 67], [0, 74], [0, 76], [1, 4], [1, 28], [1, 52], [1, 60], [2, 8], [2, 33], [2, 37], [2, 40], [2, 73], [3, 7], [3, 10], [3, 72], [4, 6], [4, 49], [4, 64], [4, 74], [4, 76], [5, 15], [5, 24], [6, 11], [6, 49], [6, 64], [7, 9], [7, 10], [7, 26], ... | {"num_nodes": 80, "bandwidth": 5, "edges": [[0, 1], [0, 67], [0, 74], [0, 76], [1, 4], [1, 28], [1, 52], [1, 60], [2, 8], [2, 33], [2, 37], [2, 40], [2, 73], [3, 7], [3, 10], [3, 72], [4, 6], [4, 49], [4, 64], [4, 74], [4, 76], [5, 15], [5, 24], [6, 11], [6, 49], [6, 64], [7, 9], [7, 10], [7, 26], [7, 50], [7, 62], [7,... | null | null | null | {"layout": [16, 21, 74, 12, 23, 59, 25, 9, 76, 10, 8, 30, 47, 69, 43, 58, 37, 31, 48, 55, 70, 65, 54, 35, 57, 32, 7, 45, 22, 38, 52, 72, 42, 78, 44, 62, 15, 75, 68, 64, 73, 26, 36, 40, 0, 39, 51, 46, 60, 27, 5, 34, 18, 66, 49, 2, 3, 79, 77, 67, 17, 50, 6, 1, 24, 33, 61, 14, 11, 53, 29, 41, 13, 71, 20, 56, 19, 4, 63, 28... | 1 |
construct-nppc-bandwidth-l6-s7 | construct | nppc_bandwidth | graph_bandwidth | graph_theory | competition | 6 | NPPC/bandwidth | MIT | [
"agentic_trivial",
"np_search"
] | Undirected graph with 80 vertices labelled 0..79 and 238 edges:
[[0, 10], [0, 46], [0, 53], [0, 74], [0, 75], [1, 11], [1, 20], [1, 28], [1, 37], [1, 51], [1, 76], [1, 78], [2, 3], [2, 12], [2, 16], [2, 54], [2, 60], [2, 64], [2, 77], [3, 12], [3, 24], [3, 25], [3, 54], [3, 58], [3, 60], [4, 15], [4, 18], [4, 19], [4, ... | {"num_nodes": 80, "bandwidth": 5, "edges": [[0, 10], [0, 46], [0, 53], [0, 74], [0, 75], [1, 11], [1, 20], [1, 28], [1, 37], [1, 51], [1, 76], [1, 78], [2, 3], [2, 12], [2, 16], [2, 54], [2, 60], [2, 64], [2, 77], [3, 12], [3, 24], [3, 25], [3, 54], [3, 58], [3, 60], [4, 15], [4, 18], [4, 19], [4, 48], [4, 55], [4, 56]... | null | null | null | {"layout": [63, 53, 38, 39, 14, 72, 6, 69, 76, 74, 64, 49, 42, 23, 25, 16, 35, 47, 9, 11, 54, 78, 24, 62, 34, 36, 21, 3, 56, 20, 66, 75, 2, 28, 30, 46, 59, 48, 17, 19, 4, 26, 0, 79, 52, 40, 65, 45, 18, 31, 50, 55, 13, 61, 41, 12, 10, 70, 44, 7, 37, 73, 1, 22, 33, 71, 27, 67, 5, 8, 60, 29, 32, 77, 58, 68, 51, 43, 57, 15... | 1 |
construct-nppc-bandwidth-l6-s8 | construct | nppc_bandwidth | graph_bandwidth | graph_theory | competition | 6 | NPPC/bandwidth | MIT | [
"agentic_trivial",
"np_search"
] | Undirected graph with 80 vertices labelled 0..79 and 229 edges:
[[0, 13], [0, 21], [0, 26], [0, 36], [0, 48], [0, 60], [1, 5], [1, 8], [1, 47], [1, 61], [2, 13], [2, 19], [2, 26], [2, 29], [2, 35], [2, 36], [2, 46], [3, 12], [3, 17], [3, 40], [3, 43], [3, 70], [4, 23], [4, 25], [4, 32], [4, 34], [4, 44], [4, 59], [4, 6... | {"num_nodes": 80, "bandwidth": 5, "edges": [[0, 13], [0, 21], [0, 26], [0, 36], [0, 48], [0, 60], [1, 5], [1, 8], [1, 47], [1, 61], [2, 13], [2, 19], [2, 26], [2, 29], [2, 35], [2, 36], [2, 46], [3, 12], [3, 17], [3, 40], [3, 43], [3, 70], [4, 23], [4, 25], [4, 32], [4, 34], [4, 44], [4, 59], [4, 66], [4, 78], [4, 79],... | null | null | null | {"layout": [45, 19, 38, 77, 64, 15, 32, 55, 17, 6, 25, 31, 76, 41, 11, 2, 51, 74, 18, 34, 56, 46, 5, 65, 4, 59, 43, 16, 7, 35, 29, 49, 66, 28, 67, 39, 42, 54, 58, 0, 73, 71, 20, 79, 68, 8, 40, 24, 50, 13, 70, 53, 48, 33, 78, 1, 52, 3, 10, 60, 44, 23, 27, 30, 22, 21, 69, 36, 12, 9, 75, 57, 37, 47, 63, 14, 26, 72, 62, 61... | 1 |
construct-nppc-bandwidth-l6-s9 | construct | nppc_bandwidth | graph_bandwidth | graph_theory | competition | 6 | NPPC/bandwidth | MIT | [
"agentic_trivial",
"np_search"
] | Undirected graph with 80 vertices labelled 0..79 and 233 edges:
[[0, 1], [0, 3], [0, 5], [0, 17], [0, 32], [0, 74], [1, 3], [1, 17], [1, 32], [2, 5], [2, 6], [2, 33], [2, 38], [2, 39], [2, 48], [2, 57], [3, 32], [4, 9], [4, 24], [4, 29], [4, 36], [4, 45], [4, 66], [4, 75], [5, 17], [5, 38], [5, 48], [5, 57], [5, 67], [... | {"num_nodes": 80, "bandwidth": 5, "edges": [[0, 1], [0, 3], [0, 5], [0, 17], [0, 32], [0, 74], [1, 3], [1, 17], [1, 32], [2, 5], [2, 6], [2, 33], [2, 38], [2, 39], [2, 48], [2, 57], [3, 32], [4, 9], [4, 24], [4, 29], [4, 36], [4, 45], [4, 66], [4, 75], [5, 17], [5, 38], [5, 48], [5, 57], [5, 67], [6, 33], [6, 39], [6, ... | null | null | null | {"layout": [4, 2, 12, 0, 37, 7, 13, 64, 70, 33, 25, 20, 62, 48, 53, 31, 39, 6, 76, 67, 77, 27, 47, 68, 34, 78, 63, 74, 50, 35, 73, 22, 1, 15, 5, 36, 42, 52, 10, 16, 32, 54, 17, 43, 71, 41, 18, 79, 11, 46, 30, 49, 56, 45, 28, 44, 57, 9, 21, 69, 72, 26, 23, 66, 55, 58, 38, 3, 61, 29, 60, 59, 75, 19, 8, 40, 14, 24, 51, 65... | 1 |
construct-nppc-clique-l1-s0 | construct | nppc_clique | graph_clique | graph_theory | competition | 1 | NPPC/clique | MIT | [
"agentic_trivial",
"np_search"
] | Undirected graph with 8 vertices labelled 0..7 and 17 edges:
[[0, 2], [0, 3], [0, 6], [0, 7], [1, 2], [1, 3], [1, 4], [1, 6], [1, 7], [2, 4], [2, 5], [2, 6], [4, 5], [4, 6], [4, 7], [5, 6], [5, 7]]
Find a clique of size at least 4: a set of distinct vertices every two of which are joined by an edge.
Answer format: {"... | {"num_nodes": 8, "k": 4, "edges": [[0, 2], [0, 3], [0, 6], [0, 7], [1, 2], [1, 3], [1, 4], [1, 6], [1, 7], [2, 4], [2, 5], [2, 6], [4, 5], [4, 6], [4, 7], [5, 6], [5, 7]], "family": "nppc_clique", "subset": "construct"} | null | null | null | {"clique": [2, 4, 5, 6]} | 1 |
construct-nppc-clique-l1-s1 | construct | nppc_clique | graph_clique | graph_theory | competition | 1 | NPPC/clique | MIT | [
"agentic_trivial",
"np_search"
] | Undirected graph with 8 vertices labelled 0..7 and 16 edges:
[[0, 2], [0, 3], [0, 6], [0, 7], [1, 3], [1, 4], [1, 6], [2, 3], [2, 4], [2, 6], [2, 7], [3, 5], [3, 7], [4, 5], [5, 6], [5, 7]]
Find a clique of size at least 4: a set of distinct vertices every two of which are joined by an edge.
Answer format: {"clique":... | {"num_nodes": 8, "k": 4, "edges": [[0, 2], [0, 3], [0, 6], [0, 7], [1, 3], [1, 4], [1, 6], [2, 3], [2, 4], [2, 6], [2, 7], [3, 5], [3, 7], [4, 5], [5, 6], [5, 7]], "family": "nppc_clique", "subset": "construct"} | null | null | null | {"clique": [0, 2, 3, 7]} | 1 |
construct-nppc-clique-l1-s2 | construct | nppc_clique | graph_clique | graph_theory | competition | 1 | NPPC/clique | MIT | [
"agentic_trivial",
"np_search"
] | Undirected graph with 8 vertices labelled 0..7 and 15 edges:
[[0, 2], [0, 3], [0, 5], [1, 4], [1, 5], [1, 6], [1, 7], [2, 3], [3, 5], [3, 6], [3, 7], [4, 7], [5, 6], [5, 7], [6, 7]]
Find a clique of size at least 4: a set of distinct vertices every two of which are joined by an edge.
Answer format: {"clique": [v_1, v... | {"num_nodes": 8, "k": 4, "edges": [[0, 2], [0, 3], [0, 5], [1, 4], [1, 5], [1, 6], [1, 7], [2, 3], [3, 5], [3, 6], [3, 7], [4, 7], [5, 6], [5, 7], [6, 7]], "family": "nppc_clique", "subset": "construct"} | null | null | null | {"clique": [3, 5, 6, 7]} | 1 |
construct-nppc-clique-l1-s3 | construct | nppc_clique | graph_clique | graph_theory | competition | 1 | NPPC/clique | MIT | [
"agentic_trivial",
"np_search"
] | Undirected graph with 8 vertices labelled 0..7 and 17 edges:
[[0, 3], [0, 4], [0, 6], [0, 7], [1, 2], [1, 3], [1, 4], [2, 3], [2, 4], [2, 6], [3, 4], [3, 5], [4, 5], [4, 6], [4, 7], [5, 7], [6, 7]]
Find a clique of size at least 4: a set of distinct vertices every two of which are joined by an edge.
Answer format: {"... | {"num_nodes": 8, "k": 4, "edges": [[0, 3], [0, 4], [0, 6], [0, 7], [1, 2], [1, 3], [1, 4], [2, 3], [2, 4], [2, 6], [3, 4], [3, 5], [4, 5], [4, 6], [4, 7], [5, 7], [6, 7]], "family": "nppc_clique", "subset": "construct"} | null | null | null | {"clique": [0, 4, 6, 7]} | 1 |
construct-nppc-clique-l1-s4 | construct | nppc_clique | graph_clique | graph_theory | competition | 1 | NPPC/clique | MIT | [
"agentic_trivial",
"np_search"
] | Undirected graph with 8 vertices labelled 0..7 and 13 edges:
[[0, 1], [0, 2], [0, 3], [0, 7], [1, 4], [2, 3], [2, 7], [3, 5], [3, 7], [4, 5], [4, 6], [4, 7], [5, 6]]
Find a clique of size at least 4: a set of distinct vertices every two of which are joined by an edge.
Answer format: {"clique": [v_1, v_2, ...]} (at le... | {"num_nodes": 8, "k": 4, "edges": [[0, 1], [0, 2], [0, 3], [0, 7], [1, 4], [2, 3], [2, 7], [3, 5], [3, 7], [4, 5], [4, 6], [4, 7], [5, 6]], "family": "nppc_clique", "subset": "construct"} | null | null | null | {"clique": [0, 2, 3, 7]} | 1 |
construct-nppc-clique-l1-s5 | construct | nppc_clique | graph_clique | graph_theory | competition | 1 | NPPC/clique | MIT | [
"agentic_trivial",
"np_search"
] | Undirected graph with 8 vertices labelled 0..7 and 15 edges:
[[0, 1], [0, 6], [1, 2], [1, 3], [1, 5], [1, 6], [1, 7], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [3, 6], [4, 6], [5, 6]]
Find a clique of size at least 4: a set of distinct vertices every two of which are joined by an edge.
Answer format: {"clique": [v_1, v... | {"num_nodes": 8, "k": 4, "edges": [[0, 1], [0, 6], [1, 2], [1, 3], [1, 5], [1, 6], [1, 7], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [3, 6], [4, 6], [5, 6]], "family": "nppc_clique", "subset": "construct"} | null | null | null | {"clique": [1, 2, 5, 6]} | 1 |
construct-nppc-clique-l1-s6 | construct | nppc_clique | graph_clique | graph_theory | competition | 1 | NPPC/clique | MIT | [
"agentic_trivial",
"np_search"
] | Undirected graph with 8 vertices labelled 0..7 and 19 edges:
[[0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [1, 3], [1, 4], [1, 5], [2, 4], [3, 4], [3, 5], [3, 6], [3, 7], [4, 5], [4, 6], [5, 6], [6, 7]]
Find a clique of size at least 4: a set of distinct vertices every two of which are joined by an edge.
A... | {"num_nodes": 8, "k": 4, "edges": [[0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [1, 3], [1, 4], [1, 5], [2, 4], [3, 4], [3, 5], [3, 6], [3, 7], [4, 5], [4, 6], [5, 6], [6, 7]], "family": "nppc_clique", "subset": "construct"} | null | null | null | {"clique": [0, 4, 5, 6]} | 1 |
construct-nppc-clique-l1-s7 | construct | nppc_clique | graph_clique | graph_theory | competition | 1 | NPPC/clique | MIT | [
"agentic_trivial",
"np_search"
] | Undirected graph with 8 vertices labelled 0..7 and 19 edges:
[[0, 1], [0, 3], [0, 6], [1, 3], [1, 4], [1, 6], [1, 7], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [3, 4], [3, 6], [3, 7], [4, 6], [4, 7], [5, 6], [6, 7]]
Find a clique of size at least 4: a set of distinct vertices every two of which are joined by an edge.
A... | {"num_nodes": 8, "k": 4, "edges": [[0, 1], [0, 3], [0, 6], [1, 3], [1, 4], [1, 6], [1, 7], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [3, 4], [3, 6], [3, 7], [4, 6], [4, 7], [5, 6], [6, 7]], "family": "nppc_clique", "subset": "construct"} | null | null | null | {"clique": [0, 1, 3, 6]} | 1 |
construct-nppc-clique-l1-s8 | construct | nppc_clique | graph_clique | graph_theory | competition | 1 | NPPC/clique | MIT | [
"agentic_trivial",
"np_search"
] | Undirected graph with 8 vertices labelled 0..7 and 15 edges:
[[0, 1], [0, 5], [0, 6], [0, 7], [1, 2], [1, 5], [1, 7], [2, 3], [2, 4], [2, 5], [2, 7], [3, 5], [3, 6], [3, 7], [5, 7]]
Find a clique of size at least 4: a set of distinct vertices every two of which are joined by an edge.
Answer format: {"clique": [v_1, v... | {"num_nodes": 8, "k": 4, "edges": [[0, 1], [0, 5], [0, 6], [0, 7], [1, 2], [1, 5], [1, 7], [2, 3], [2, 4], [2, 5], [2, 7], [3, 5], [3, 6], [3, 7], [5, 7]], "family": "nppc_clique", "subset": "construct"} | null | null | null | {"clique": [0, 1, 5, 7]} | 1 |
construct-nppc-clique-l1-s9 | construct | nppc_clique | graph_clique | graph_theory | competition | 1 | NPPC/clique | MIT | [
"agentic_trivial",
"np_search"
] | Undirected graph with 8 vertices labelled 0..7 and 22 edges:
[[0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [1, 5], [1, 6], [1, 7], [2, 3], [2, 4], [2, 6], [2, 7], [3, 4], [3, 5], [3, 6], [3, 7], [4, 6], [5, 6], [5, 7], [6, 7]]
Find a clique of size at least 4: a set of distinct vertices every two of which a... | {"num_nodes": 8, "k": 4, "edges": [[0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [1, 5], [1, 6], [1, 7], [2, 3], [2, 4], [2, 6], [2, 7], [3, 4], [3, 5], [3, 6], [3, 7], [4, 6], [5, 6], [5, 7], [6, 7]], "family": "nppc_clique", "subset": "construct"} | null | null | null | {"clique": [1, 5, 6, 7]} | 1 |
construct-nppc-clique-l2-s0 | construct | nppc_clique | graph_clique | graph_theory | competition | 2 | NPPC/clique | MIT | [
"agentic_trivial",
"np_search"
] | Undirected graph with 14 vertices labelled 0..13 and 58 edges:
[[0, 2], [0, 3], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 13], [1, 4], [1, 6], [1, 7], [2, 3], [2, 5], [2, 6], [2, 9], [2, 11], [2, 12], [3, 4], [3, 5], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [4, 5], [4, 6], [4, 8], [4, 9], [4, 12], ... | {"num_nodes": 14, "k": 7, "edges": [[0, 2], [0, 3], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 13], [1, 4], [1, 6], [1, 7], [2, 3], [2, 5], [2, 6], [2, 9], [2, 11], [2, 12], [3, 4], [3, 5], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [4, 5], [4, 6], [4, 8], [4, 9], [4, 12], [4, 13], [5, 6], [5, 9], [5,... | null | null | null | {"clique": [3, 7, 8, 9, 10, 11, 12]} | 1 |
construct-nppc-clique-l2-s1 | construct | nppc_clique | graph_clique | graph_theory | competition | 2 | NPPC/clique | MIT | [
"agentic_trivial",
"np_search"
] | Undirected graph with 14 vertices labelled 0..13 and 60 edges:
[[0, 1], [0, 4], [0, 6], [0, 8], [0, 9], [0, 11], [0, 13], [1, 2], [1, 3], [1, 5], [1, 6], [1, 8], [1, 9], [1, 10], [1, 12], [1, 13], [2, 3], [2, 5], [2, 6], [2, 7], [2, 9], [2, 10], [2, 11], [2, 12], [3, 4], [3, 5], [3, 6], [3, 8], [3, 9], [3, 11], [3, 12]... | {"num_nodes": 14, "k": 7, "edges": [[0, 1], [0, 4], [0, 6], [0, 8], [0, 9], [0, 11], [0, 13], [1, 2], [1, 3], [1, 5], [1, 6], [1, 8], [1, 9], [1, 10], [1, 12], [1, 13], [2, 3], [2, 5], [2, 6], [2, 7], [2, 9], [2, 10], [2, 11], [2, 12], [3, 4], [3, 5], [3, 6], [3, 8], [3, 9], [3, 11], [3, 12], [4, 8], [4, 11], [4, 12], ... | null | null | null | {"clique": [1, 2, 3, 5, 6, 9, 12]} | 1 |
construct-nppc-clique-l2-s2 | construct | nppc_clique | graph_clique | graph_theory | competition | 2 | NPPC/clique | MIT | [
"agentic_trivial",
"np_search"
] | Undirected graph with 14 vertices labelled 0..13 and 63 edges:
[[0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 7], [0, 10], [0, 11], [0, 12], [0, 13], [1, 2], [1, 3], [1, 5], [1, 6], [1, 7], [1, 8], [1, 11], [1, 12], [1, 13], [2, 3], [2, 4], [2, 6], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [3, 4], [3, 5], [3, 6], [3, 7]... | {"num_nodes": 14, "k": 7, "edges": [[0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 7], [0, 10], [0, 11], [0, 12], [0, 13], [1, 2], [1, 3], [1, 5], [1, 6], [1, 7], [1, 8], [1, 11], [1, 12], [1, 13], [2, 3], [2, 4], [2, 6], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 10], [3, 11], ... | null | null | null | {"clique": [0, 1, 3, 5, 7, 11, 12]} | 1 |
construct-nppc-clique-l2-s3 | construct | nppc_clique | graph_clique | graph_theory | competition | 2 | NPPC/clique | MIT | [
"agentic_trivial",
"np_search"
] | Undirected graph with 14 vertices labelled 0..13 and 52 edges:
[[0, 3], [0, 4], [0, 6], [0, 7], [0, 8], [0, 9], [0, 12], [1, 2], [1, 3], [1, 6], [1, 7], [1, 8], [1, 10], [1, 11], [1, 12], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [3, 4], [3, 5], [3, 6], [3, 7], [4, 7], [4, 10], [4, 11], [4, 12], [4, 1... | {"num_nodes": 14, "k": 7, "edges": [[0, 3], [0, 4], [0, 6], [0, 7], [0, 8], [0, 9], [0, 12], [1, 2], [1, 3], [1, 6], [1, 7], [1, 8], [1, 10], [1, 11], [1, 12], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [3, 4], [3, 5], [3, 6], [3, 7], [4, 7], [4, 10], [4, 11], [4, 12], [4, 13], [5, 6], [5, 8], [5, 9], ... | null | null | null | {"clique": [1, 2, 7, 8, 10, 11, 12]} | 1 |
construct-nppc-clique-l2-s4 | construct | nppc_clique | graph_clique | graph_theory | competition | 2 | NPPC/clique | MIT | [
"agentic_trivial",
"np_search"
] | Undirected graph with 14 vertices labelled 0..13 and 63 edges:
[[0, 1], [0, 2], [0, 3], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 13], [1, 2], [1, 4], [1, 5], [1, 7], [1, 8], [1, 11], [1, 13], [2, 3], [2, 5], [2, 6], [2, 7], [2, 8], [2, 12], [2, 13], [3, 4], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 13], [4, 5], ... | {"num_nodes": 14, "k": 7, "edges": [[0, 1], [0, 2], [0, 3], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 13], [1, 2], [1, 4], [1, 5], [1, 7], [1, 8], [1, 11], [1, 13], [2, 3], [2, 5], [2, 6], [2, 7], [2, 8], [2, 12], [2, 13], [3, 4], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 13], [4, 5], [4, 9], [4, 11], [4, 12], [4... | null | null | null | {"clique": [0, 2, 3, 6, 7, 8, 13]} | 1 |
construct-nppc-clique-l2-s5 | construct | nppc_clique | graph_clique | graph_theory | competition | 2 | NPPC/clique | MIT | [
"agentic_trivial",
"np_search"
] | Undirected graph with 14 vertices labelled 0..13 and 50 edges:
[[0, 2], [0, 3], [0, 4], [0, 6], [0, 8], [0, 9], [0, 10], [0, 12], [0, 13], [1, 3], [1, 6], [1, 7], [1, 8], [1, 10], [2, 6], [2, 11], [2, 13], [3, 8], [3, 10], [3, 11], [3, 12], [3, 13], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4,... | {"num_nodes": 14, "k": 7, "edges": [[0, 2], [0, 3], [0, 4], [0, 6], [0, 8], [0, 9], [0, 10], [0, 12], [0, 13], [1, 3], [1, 6], [1, 7], [1, 8], [1, 10], [2, 6], [2, 11], [2, 13], [3, 8], [3, 10], [3, 11], [3, 12], [3, 13], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [4, 13], [5, 6], [5, 11], [6, 8... | null | null | null | {"clique": [0, 4, 6, 8, 9, 10, 12]} | 1 |
construct-nppc-clique-l2-s6 | construct | nppc_clique | graph_clique | graph_theory | competition | 2 | NPPC/clique | MIT | [
"agentic_trivial",
"np_search"
] | Undirected graph with 14 vertices labelled 0..13 and 57 edges:
[[0, 1], [0, 2], [0, 3], [0, 4], [0, 8], [0, 9], [0, 12], [0, 13], [1, 2], [1, 3], [1, 4], [1, 6], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [2, 3], [2, 4], [2, 5], [2, 7], [2, 9], [2, 13], [3, 4], [3, 6], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12]... | {"num_nodes": 14, "k": 7, "edges": [[0, 1], [0, 2], [0, 3], [0, 4], [0, 8], [0, 9], [0, 12], [0, 13], [1, 2], [1, 3], [1, 4], [1, 6], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [2, 3], [2, 4], [2, 5], [2, 7], [2, 9], [2, 13], [3, 4], [3, 6], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [4, 8], [4, 9], [... | null | null | null | {"clique": [0, 1, 3, 8, 9, 12, 13]} | 1 |
construct-nppc-clique-l2-s7 | construct | nppc_clique | graph_clique | graph_theory | competition | 2 | NPPC/clique | MIT | [
"agentic_trivial",
"np_search"
] | Undirected graph with 14 vertices labelled 0..13 and 49 edges:
[[0, 1], [0, 3], [0, 4], [0, 5], [0, 7], [0, 8], [0, 10], [1, 3], [1, 12], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 13], [3, 6], [3, 9], [3, 11], [3, 13], [4, 5], [4, 6], [4, 7], [4, 11], [5, 8], [5, 10], [5, 11], [5, 12], [5, 13], [6, 7... | {"num_nodes": 14, "k": 7, "edges": [[0, 1], [0, 3], [0, 4], [0, 5], [0, 7], [0, 8], [0, 10], [1, 3], [1, 12], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 13], [3, 6], [3, 9], [3, 11], [3, 13], [4, 5], [4, 6], [4, 7], [4, 11], [5, 8], [5, 10], [5, 11], [5, 12], [5, 13], [6, 7], [6, 8], [6, 9], [6, 10], ... | null | null | null | {"clique": [2, 6, 7, 8, 9, 10, 13]} | 1 |
construct-nppc-clique-l2-s8 | construct | nppc_clique | graph_clique | graph_theory | competition | 2 | NPPC/clique | MIT | [
"agentic_trivial",
"np_search"
] | Undirected graph with 14 vertices labelled 0..13 and 50 edges:
[[0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 10], [0, 11], [0, 12], [0, 13], [1, 5], [1, 6], [1, 7], [1, 9], [1, 10], [1, 12], [2, 4], [2, 5], [2, 9], [2, 11], [3, 10], [3, 11], [3, 13], [4, 5], [4, 6], [4, 7], [4, 10], [4, 12], [4, 13], [5,... | {"num_nodes": 14, "k": 7, "edges": [[0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 10], [0, 11], [0, 12], [0, 13], [1, 5], [1, 6], [1, 7], [1, 9], [1, 10], [1, 12], [2, 4], [2, 5], [2, 9], [2, 11], [3, 10], [3, 11], [3, 13], [4, 5], [4, 6], [4, 7], [4, 10], [4, 12], [4, 13], [5, 6], [5, 7], [5, 10], [5, 12... | null | null | null | {"clique": [0, 1, 5, 6, 7, 10, 12]} | 1 |
construct-nppc-clique-l2-s9 | construct | nppc_clique | graph_clique | graph_theory | competition | 2 | NPPC/clique | MIT | [
"agentic_trivial",
"np_search"
] | Undirected graph with 14 vertices labelled 0..13 and 47 edges:
[[0, 3], [0, 5], [0, 9], [1, 2], [1, 6], [1, 10], [1, 11], [1, 13], [2, 3], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [3, 8], [3, 9], [3, 12], [3, 13], [4, 6], [4, 8], [4, 9], [4, 10], [4, 13], [5, 9], [5, 11], [6, 9], [6, 10], [6,... | {"num_nodes": 14, "k": 7, "edges": [[0, 3], [0, 5], [0, 9], [1, 2], [1, 6], [1, 10], [1, 11], [1, 13], [2, 3], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [3, 8], [3, 9], [3, 12], [3, 13], [4, 6], [4, 8], [4, 9], [4, 10], [4, 13], [5, 9], [5, 11], [6, 9], [6, 10], [6, 11], [6, 12], [6, 13], [7, ... | null | null | null | {"clique": [2, 6, 9, 10, 11, 12, 13]} | 1 |
construct-nppc-clique-l3-s0 | construct | nppc_clique | graph_clique | graph_theory | competition | 3 | NPPC/clique | MIT | [
"agentic_trivial",
"np_search"
] | Undirected graph with 20 vertices labelled 0..19 and 119 edges:
[[0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [0, 15], [0, 16], [0, 17], [0, 19], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [1, 16], [1, 19], [2, 4],... | {"num_nodes": 20, "k": 10, "edges": [[0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [0, 15], [0, 16], [0, 17], [0, 19], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [1, 16], [1, 19], [2, 4], [2, 9], [2, 10], [2, 11], [... | null | null | null | {"clique": [0, 1, 3, 5, 6, 10, 11, 12, 13, 14]} | 1 |
construct-nppc-clique-l3-s1 | construct | nppc_clique | graph_clique | graph_theory | competition | 3 | NPPC/clique | MIT | [
"agentic_trivial",
"np_search"
] | Undirected graph with 20 vertices labelled 0..19 and 97 edges:
[[0, 1], [0, 3], [0, 7], [0, 8], [0, 11], [0, 17], [1, 2], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [1, 15], [1, 18], [1, 19], [2, 4], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [2, 15], [2, 17],... | {"num_nodes": 20, "k": 10, "edges": [[0, 1], [0, 3], [0, 7], [0, 8], [0, 11], [0, 17], [1, 2], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [1, 15], [1, 18], [1, 19], [2, 4], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [2, 15], [2, 17], [2, 19], [3, 5], [3, 6], [... | null | null | null | {"clique": [1, 2, 7, 8, 9, 10, 12, 13, 15, 19]} | 1 |
construct-nppc-clique-l3-s2 | construct | nppc_clique | graph_clique | graph_theory | competition | 3 | NPPC/clique | MIT | [
"agentic_trivial",
"np_search"
] | Undirected graph with 20 vertices labelled 0..19 and 121 edges:
[[0, 2], [0, 3], [0, 4], [0, 6], [0, 7], [0, 8], [0, 9], [0, 11], [0, 16], [0, 17], [0, 18], [0, 19], [1, 2], [1, 7], [1, 9], [1, 12], [1, 13], [1, 14], [1, 18], [1, 19], [2, 3], [2, 4], [2, 5], [2, 7], [2, 8], [2, 9], [2, 11], [2, 12], [2, 15], [2, 16], [... | {"num_nodes": 20, "k": 10, "edges": [[0, 2], [0, 3], [0, 4], [0, 6], [0, 7], [0, 8], [0, 9], [0, 11], [0, 16], [0, 17], [0, 18], [0, 19], [1, 2], [1, 7], [1, 9], [1, 12], [1, 13], [1, 14], [1, 18], [1, 19], [2, 3], [2, 4], [2, 5], [2, 7], [2, 8], [2, 9], [2, 11], [2, 12], [2, 15], [2, 16], [2, 17], [2, 18], [2, 19], [3... | null | null | null | {"clique": [0, 2, 3, 4, 8, 9, 16, 17, 18, 19]} | 1 |
construct-nppc-clique-l3-s3 | construct | nppc_clique | graph_clique | graph_theory | competition | 3 | NPPC/clique | MIT | [
"agentic_trivial",
"np_search"
] | Undirected graph with 20 vertices labelled 0..19 and 124 edges:
[[0, 1], [0, 2], [0, 3], [0, 5], [0, 6], [0, 7], [0, 9], [0, 10], [0, 13], [0, 14], [0, 16], [0, 17], [0, 18], [0, 19], [1, 2], [1, 4], [1, 5], [1, 7], [1, 10], [1, 12], [1, 13], [1, 16], [1, 17], [1, 19], [2, 3], [2, 4], [2, 5], [2, 7], [2, 9], [2, 10], [... | {"num_nodes": 20, "k": 10, "edges": [[0, 1], [0, 2], [0, 3], [0, 5], [0, 6], [0, 7], [0, 9], [0, 10], [0, 13], [0, 14], [0, 16], [0, 17], [0, 18], [0, 19], [1, 2], [1, 4], [1, 5], [1, 7], [1, 10], [1, 12], [1, 13], [1, 16], [1, 17], [1, 19], [2, 3], [2, 4], [2, 5], [2, 7], [2, 9], [2, 10], [2, 11], [2, 13], [2, 15], [2... | null | null | null | {"clique": [0, 2, 3, 5, 7, 9, 10, 17, 18, 19]} | 1 |
construct-nppc-clique-l3-s4 | construct | nppc_clique | graph_clique | graph_theory | competition | 3 | NPPC/clique | MIT | [
"agentic_trivial",
"np_search"
] | Undirected graph with 20 vertices labelled 0..19 and 132 edges:
[[0, 1], [0, 2], [0, 3], [0, 5], [0, 7], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [0, 15], [0, 16], [0, 17], [0, 18], [1, 2], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 14], [1, 15], [1, 16], [2, 3], [2, 4], [2, 5], [2, 6], [... | {"num_nodes": 20, "k": 10, "edges": [[0, 1], [0, 2], [0, 3], [0, 5], [0, 7], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [0, 15], [0, 16], [0, 17], [0, 18], [1, 2], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 14], [1, 15], [1, 16], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 1... | null | null | null | {"clique": [0, 2, 3, 5, 7, 10, 13, 14, 15, 18]} | 1 |
construct-nppc-clique-l3-s5 | construct | nppc_clique | graph_clique | graph_theory | competition | 3 | NPPC/clique | MIT | [
"agentic_trivial",
"np_search"
] | Undirected graph with 20 vertices labelled 0..19 and 108 edges:
[[0, 1], [0, 2], [0, 4], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 15], [0, 16], [0, 17], [0, 18], [0, 19], [1, 4], [1, 6], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 16], [1, 17], [1, 18], [1, 19], [2, 9], [2, 10], [2, 16], [2, 18], [2, 19], [3,... | {"num_nodes": 20, "k": 10, "edges": [[0, 1], [0, 2], [0, 4], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 15], [0, 16], [0, 17], [0, 18], [0, 19], [1, 4], [1, 6], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 16], [1, 17], [1, 18], [1, 19], [2, 9], [2, 10], [2, 16], [2, 18], [2, 19], [3, 5], [3, 6], [3, 8], [3, 9],... | null | null | null | {"clique": [0, 1, 4, 9, 10, 12, 16, 17, 18, 19]} | 1 |
construct-nppc-clique-l3-s6 | construct | nppc_clique | graph_clique | graph_theory | competition | 3 | NPPC/clique | MIT | [
"agentic_trivial",
"np_search"
] | Undirected graph with 20 vertices labelled 0..19 and 107 edges:
[[0, 1], [0, 3], [0, 4], [0, 5], [0, 7], [0, 9], [0, 11], [0, 12], [0, 13], [0, 14], [0, 19], [1, 3], [1, 5], [1, 7], [1, 8], [1, 11], [1, 18], [2, 3], [2, 9], [2, 10], [2, 11], [2, 13], [2, 15], [2, 16], [2, 17], [2, 18], [3, 4], [3, 5], [3, 7], [3, 8], [... | {"num_nodes": 20, "k": 10, "edges": [[0, 1], [0, 3], [0, 4], [0, 5], [0, 7], [0, 9], [0, 11], [0, 12], [0, 13], [0, 14], [0, 19], [1, 3], [1, 5], [1, 7], [1, 8], [1, 11], [1, 18], [2, 3], [2, 9], [2, 10], [2, 11], [2, 13], [2, 15], [2, 16], [2, 17], [2, 18], [3, 4], [3, 5], [3, 7], [3, 8], [3, 9], [3, 11], [3, 12], [3,... | null | null | null | {"clique": [3, 4, 5, 8, 9, 11, 12, 13, 18, 19]} | 1 |
construct-nppc-clique-l3-s7 | construct | nppc_clique | graph_clique | graph_theory | competition | 3 | NPPC/clique | MIT | [
"agentic_trivial",
"np_search"
] | Undirected graph with 20 vertices labelled 0..19 and 118 edges:
[[0, 4], [0, 6], [0, 7], [0, 8], [0, 11], [0, 13], [0, 14], [0, 18], [0, 19], [1, 2], [1, 3], [1, 6], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 16], [1, 17], [1, 18], [2, 9], [2, 10], [2, 11], [2, 12], [2, 16], [3, 4], [3, 5], [3, 6], [3, 7],... | {"num_nodes": 20, "k": 10, "edges": [[0, 4], [0, 6], [0, 7], [0, 8], [0, 11], [0, 13], [0, 14], [0, 18], [0, 19], [1, 2], [1, 3], [1, 6], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 16], [1, 17], [1, 18], [2, 9], [2, 10], [2, 11], [2, 12], [2, 16], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3... | null | null | null | {"clique": [4, 6, 8, 9, 10, 11, 12, 13, 15, 18]} | 1 |
construct-nppc-clique-l3-s8 | construct | nppc_clique | graph_clique | graph_theory | competition | 3 | NPPC/clique | MIT | [
"agentic_trivial",
"np_search"
] | Undirected graph with 20 vertices labelled 0..19 and 120 edges:
[[0, 1], [0, 3], [0, 4], [0, 5], [0, 6], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 16], [0, 17], [0, 18], [0, 19], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 8], [1, 9], [1, 10], [1, 11], [1, 13], [1, 14], [1, 16], [1, 17], [2, 3], [2, 8], [... | {"num_nodes": 20, "k": 10, "edges": [[0, 1], [0, 3], [0, 4], [0, 5], [0, 6], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 16], [0, 17], [0, 18], [0, 19], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 8], [1, 9], [1, 10], [1, 11], [1, 13], [1, 14], [1, 16], [1, 17], [2, 3], [2, 8], [2, 9], [2, 11], [2, 13], [2,... | null | null | null | {"clique": [0, 1, 3, 4, 6, 9, 10, 11, 16, 17]} | 1 |
construct-nppc-clique-l3-s9 | construct | nppc_clique | graph_clique | graph_theory | competition | 3 | NPPC/clique | MIT | [
"agentic_trivial",
"np_search"
] | Undirected graph with 20 vertices labelled 0..19 and 122 edges:
[[0, 1], [0, 2], [0, 3], [0, 6], [0, 9], [0, 10], [0, 11], [0, 12], [0, 15], [1, 3], [1, 4], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 13], [1, 14], [1, 15], [1, 16], [1, 17], [1, 18], [1, 19], [2, 6], [2, 9], [2, 10], [2, 13], [2, 15], [2, 16]... | {"num_nodes": 20, "k": 10, "edges": [[0, 1], [0, 2], [0, 3], [0, 6], [0, 9], [0, 10], [0, 11], [0, 12], [0, 15], [1, 3], [1, 4], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 13], [1, 14], [1, 15], [1, 16], [1, 17], [1, 18], [1, 19], [2, 6], [2, 9], [2, 10], [2, 13], [2, 15], [2, 16], [2, 18], [3, 4], [3, 5], [... | null | null | null | {"clique": [1, 4, 7, 8, 9, 10, 15, 16, 18, 19]} | 1 |
construct-nppc-clique-l4-s0 | construct | nppc_clique | graph_clique | graph_theory | competition | 4 | NPPC/clique | MIT | [
"agentic_trivial",
"np_search"
] | Undirected graph with 30 vertices labelled 0..29 and 260 edges:
[[0, 1], [0, 4], [0, 5], [0, 6], [0, 8], [0, 9], [0, 11], [0, 12], [0, 14], [0, 16], [0, 17], [0, 18], [0, 19], [0, 21], [0, 22], [0, 23], [0, 24], [0, 25], [0, 26], [1, 3], [1, 4], [1, 6], [1, 8], [1, 10], [1, 12], [1, 16], [1, 18], [1, 25], [1, 27], [1, ... | {"num_nodes": 30, "k": 15, "edges": [[0, 1], [0, 4], [0, 5], [0, 6], [0, 8], [0, 9], [0, 11], [0, 12], [0, 14], [0, 16], [0, 17], [0, 18], [0, 19], [0, 21], [0, 22], [0, 23], [0, 24], [0, 25], [0, 26], [1, 3], [1, 4], [1, 6], [1, 8], [1, 10], [1, 12], [1, 16], [1, 18], [1, 25], [1, 27], [1, 28], [2, 4], [2, 6], [2, 7],... | null | null | null | {"clique": [0, 4, 9, 11, 14, 16, 17, 18, 19, 21, 22, 23, 24, 25, 26]} | 1 |
construct-nppc-clique-l4-s1 | construct | nppc_clique | graph_clique | graph_theory | competition | 4 | NPPC/clique | MIT | [
"agentic_trivial",
"np_search"
] | Undirected graph with 30 vertices labelled 0..29 and 254 edges:
[[0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 14], [0, 15], [0, 17], [0, 18], [0, 19], [0, 20], [0, 23], [0, 24], [0, 26], [0, 28], [1, 2], [1, 6], [1, 9], [1, 10], [1, 11], [1, 14], [1, 27], [1, 28], [1, 2... | {"num_nodes": 30, "k": 15, "edges": [[0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 14], [0, 15], [0, 17], [0, 18], [0, 19], [0, 20], [0, 23], [0, 24], [0, 26], [0, 28], [1, 2], [1, 6], [1, 9], [1, 10], [1, 11], [1, 14], [1, 27], [1, 28], [1, 29], [2, 3], [2, 4], [2, 7], ... | null | null | null | {"clique": [0, 2, 3, 7, 9, 10, 11, 14, 15, 17, 19, 20, 23, 26, 28]} | 1 |
construct-nppc-clique-l4-s2 | construct | nppc_clique | graph_clique | graph_theory | competition | 4 | NPPC/clique | MIT | [
"agentic_trivial",
"np_search"
] | Undirected graph with 30 vertices labelled 0..29 and 270 edges:
[[0, 1], [0, 2], [0, 3], [0, 4], [0, 7], [0, 8], [0, 9], [0, 14], [0, 15], [0, 16], [0, 17], [0, 19], [0, 20], [0, 22], [0, 23], [0, 24], [0, 27], [0, 28], [0, 29], [1, 3], [1, 4], [1, 6], [1, 7], [1, 8], [1, 10], [1, 11], [1, 13], [1, 16], [1, 18], [1, 19... | {"num_nodes": 30, "k": 15, "edges": [[0, 1], [0, 2], [0, 3], [0, 4], [0, 7], [0, 8], [0, 9], [0, 14], [0, 15], [0, 16], [0, 17], [0, 19], [0, 20], [0, 22], [0, 23], [0, 24], [0, 27], [0, 28], [0, 29], [1, 3], [1, 4], [1, 6], [1, 7], [1, 8], [1, 10], [1, 11], [1, 13], [1, 16], [1, 18], [1, 19], [1, 20], [1, 21], [1, 22]... | null | null | null | {"clique": [1, 3, 4, 6, 7, 8, 10, 13, 16, 18, 19, 20, 26, 28, 29]} | 1 |
construct-nppc-clique-l4-s3 | construct | nppc_clique | graph_clique | graph_theory | competition | 4 | NPPC/clique | MIT | [
"agentic_trivial",
"np_search"
] | Undirected graph with 30 vertices labelled 0..29 and 262 edges:
[[0, 1], [0, 2], [0, 3], [0, 6], [0, 7], [0, 9], [0, 10], [0, 14], [0, 15], [0, 16], [0, 17], [0, 18], [0, 20], [0, 21], [0, 22], [0, 29], [1, 7], [1, 8], [1, 9], [1, 13], [1, 14], [1, 15], [1, 16], [1, 18], [1, 20], [1, 21], [1, 26], [2, 4], [2, 6], [2, 7... | {"num_nodes": 30, "k": 15, "edges": [[0, 1], [0, 2], [0, 3], [0, 6], [0, 7], [0, 9], [0, 10], [0, 14], [0, 15], [0, 16], [0, 17], [0, 18], [0, 20], [0, 21], [0, 22], [0, 29], [1, 7], [1, 8], [1, 9], [1, 13], [1, 14], [1, 15], [1, 16], [1, 18], [1, 20], [1, 21], [1, 26], [2, 4], [2, 6], [2, 7], [2, 10], [2, 11], [2, 12]... | null | null | null | {"clique": [2, 4, 6, 7, 10, 12, 13, 14, 18, 19, 23, 24, 25, 26, 29]} | 1 |
construct-nppc-clique-l4-s4 | construct | nppc_clique | graph_clique | graph_theory | competition | 4 | NPPC/clique | MIT | [
"agentic_trivial",
"np_search"
] | Undirected graph with 30 vertices labelled 0..29 and 275 edges:
[[0, 4], [0, 6], [0, 8], [0, 9], [0, 14], [0, 15], [0, 16], [0, 17], [0, 19], [0, 23], [0, 26], [0, 27], [0, 28], [0, 29], [1, 2], [1, 3], [1, 9], [1, 10], [1, 13], [1, 14], [1, 15], [1, 16], [1, 17], [1, 18], [1, 19], [1, 22], [1, 23], [1, 24], [1, 25], [... | {"num_nodes": 30, "k": 15, "edges": [[0, 4], [0, 6], [0, 8], [0, 9], [0, 14], [0, 15], [0, 16], [0, 17], [0, 19], [0, 23], [0, 26], [0, 27], [0, 28], [0, 29], [1, 2], [1, 3], [1, 9], [1, 10], [1, 13], [1, 14], [1, 15], [1, 16], [1, 17], [1, 18], [1, 19], [1, 22], [1, 23], [1, 24], [1, 25], [1, 26], [1, 27], [1, 28], [1... | null | null | null | {"clique": [1, 9, 10, 13, 15, 16, 17, 18, 19, 23, 24, 26, 27, 28, 29]} | 1 |
construct-nppc-clique-l4-s5 | construct | nppc_clique | graph_clique | graph_theory | competition | 4 | NPPC/clique | MIT | [
"agentic_trivial",
"np_search"
] | Undirected graph with 30 vertices labelled 0..29 and 277 edges:
[[0, 1], [0, 2], [0, 4], [0, 6], [0, 7], [0, 8], [0, 10], [0, 12], [0, 14], [0, 15], [0, 18], [0, 19], [0, 20], [0, 21], [0, 23], [0, 24], [0, 25], [1, 3], [1, 4], [1, 6], [1, 8], [1, 10], [1, 13], [1, 14], [1, 15], [1, 17], [1, 18], [1, 19], [1, 20], [1, ... | {"num_nodes": 30, "k": 15, "edges": [[0, 1], [0, 2], [0, 4], [0, 6], [0, 7], [0, 8], [0, 10], [0, 12], [0, 14], [0, 15], [0, 18], [0, 19], [0, 20], [0, 21], [0, 23], [0, 24], [0, 25], [1, 3], [1, 4], [1, 6], [1, 8], [1, 10], [1, 13], [1, 14], [1, 15], [1, 17], [1, 18], [1, 19], [1, 20], [1, 23], [2, 3], [2, 4], [2, 7],... | null | null | null | {"clique": [3, 7, 8, 10, 11, 12, 14, 17, 18, 19, 20, 22, 25, 27, 29]} | 1 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.