%0 Journal Article %1 journals/ijfcs/GelleI19 %A Gelle, Kitti %A Iván, Szabolcs %D 2019 %J Int. J. Found. Comput. Sci. %K dblp %N 6-7 %P 1029-1045 %T Recognizing Union-Find Trees is NP-Complete, Even Without Rank Info. %U http://dblp.uni-trier.de/db/journals/ijfcs/ijfcs30.html#GelleI19 %V 30

@article{journals/ijfcs/GelleI19, added-at = {2019-10-08T00:00:00.000+0200}, author = {Gelle, Kitti and Iván, Szabolcs}, biburl = {https://www.bibsonomy.org/bibtex/276dac8952cfe33e69a084752e903339b/dblp}, ee = {https://doi.org/10.1142/S0129054119400276}, interhash = {a94b5916a4108880d5a00d24cab3cee0}, intrahash = {76dac8952cfe33e69a084752e903339b}, journal = {Int. J. Found. Comput. Sci.}, keywords = {dblp}, number = {6-7}, pages = {1029-1045}, timestamp = {2019-10-09T11:38:29.000+0200}, title = {Recognizing Union-Find Trees is NP-Complete, Even Without Rank Info.}, url = {http://dblp.uni-trier.de/db/journals/ijfcs/ijfcs30.html#GelleI19}, volume = 30, year = 2019 }