@inproceedings{gelle:hal-01657003,
  TITLE = {{Recognizing Union-Find Trees Built Up Using Union-By-Rank Strategy is NP-Complete}},
  AUTHOR = {Gelle, Kitti and Iv{\'a}n, Szabolcs},
  URL = {https://inria.hal.science/hal-01657003},
  NOTE = {Part 2: Contributed Papers},
  BOOKTITLE = {{19th International Conference on Descriptional Complexity of Formal Systems (DCFS)}},
  ADDRESS = {Milano, Italy},
  EDITOR = {Giovanni Pighizzini and Cezar C{\^a}mpeanu},
  PUBLISHER = {{Springer International Publishing}},
  SERIES = {Descriptional Complexity of Formal Systems},
  VOLUME = {LNCS-10316},
  PAGES = {152-163},
  YEAR = {2017},
  MONTH = Jul,
  DOI = {10.1007/978-3-319-60252-3\_12},
  PDF = {https://inria.hal.science/hal-01657003/file/440206_1_En_12_Chapter.pdf},
  HAL_ID = {hal-01657003},
  HAL_VERSION = {v1},
}