graph_exact_distance_square_root_problem (431B)
1 # Graph exact distance square root problem 2 3 The [computational_problem], given an [undirected_graph] G, of deciding whether G is the [graph_exact_distance_square] of some graph G' 4 5 studied in [bai2024characterizing]: it is [PTIME] 6 - however, if you want to know whether a [graph_bipartite] G' exists, then it is [NP_hard] 7 8 Up: [graph_exact_distance_square] 9 10 See also: [graph_exact_square_root_problem], [graph_square_root_problem]