A graph H is a core if any homomorphism from H to itself is a bijection. A subgraph H of G is a core of G if H is a core and there is a homomorphism from G to H. http://en.wikipedia.org/wiki/Core_%28graph_theory%29Given a graph G, what is the best known exact algorithm to find its core?
What is the best exact algorithm to compute the core of a graph?
ds.algorithms;graph theory;graph algorithms