Assertion: graph isomorphism | /r/CapableOf | solve the problem
Facets:
value: for every single graph
type: OTHER
value: efficiently
type: MANNER
Source sentences:
text: On the one hand, there are practical algorithms for graph isomorphism that can’t solve the problem efficiently for every single graph, but that do well on almost any graph you might throw at them, even randomly chosen ones.