New answers tagged


Graph isomorphism is GI-complete for DAGs: The problem for partial orders is also GI-complete: We can reduce bipartite graph isomorphism (which is GI-complete) to 2 instances of DAG isomorphism where the DAG equals its transitive closure by considering two canonical ways to turn a ...

Top 50 recent answers are included