Assertion: large graph | /r/CapableOf | arise in application
Facets:
Source sentences:
text: While no worst-case polynomial-time algorithms are known for the general Graph Automorphism problem, finding the automorphism group (and printing out an irredundant set of generators) for many large graphs arising in applications is rather easy.