Kitti Gelle, Szabolcs Iván. Recognizing Union-Find Trees Built Up Using Union-By-Rank Strategy is NP-Complete. In Giovanni Pighizzini, Cezar Câmpeanu, editors, Descriptional Complexity of Formal Systems - 19th IFIP WG 1.02 International Conference, DCFS 2017, Milano, Italy, July 3-5, 2017, Proceedings. Volume 10316 of Lecture Notes in Computer Science, pages 152-163, Springer, 2017. [doi]
Abstract is missing.