Recognizing Union-Find Trees Built Up Using Union-By-Rank Strategy is NP-Complete.

Kitti Gelle Szabolcs Iván

Published in: DCFS (2017)

Keyphrases

np complete
randomly generated
np hard
decision trees
satisfiability problem
computational complexity
neural network
search engine
information systems
similarity measure