graph_minor_testing (266B)
1 # Graph minor testing 2 3 Given [undirected_graphs] G and H, decide whether G a [graph_minor] of H 4 5 Can be done in [almost_linear_time] for fixed H [korhonen2024minor] 6 7 Special cases: 8 - [planarity_testing] 9 - [disjoint_paths] 10 11 Up: [computational_problem], [graph_minor]