Treffer: The recognition of union trees
Title:
The recognition of union trees
Authors:
Source:
Information processing letters. 45(6):279-283
Publisher Information:
Amsterdam: Elsevier Science, 1993.
Publication Year:
1993
Physical Description:
print, 4 ref
Original Material:
INIST-CNRS
Subject Terms:
Computer science, Informatique, Sciences exactes et technologie, Exact sciences and technology, Sciences appliquees, Applied sciences, Informatique; automatique theorique; systemes, Computer science; control theory; systems, Informatique théorique, Theoretical computing, Algorithmique. Calculabilité. Arithmétique ordinateur, Algorithmics. Computability. Computer arithmetics, Calculabilité, Computability, Calculabilidad, Complexité calcul, Computing complexity, Complejidad cálculo, Conception algorithme, Algorithm design, Reconnaissance arbre fusion, Fusion tree recognition, Union ensemble disjoint, Disjoint set union
Document Type:
Fachzeitschrift
Article
File Description:
text
Language:
English
Author Affiliations:
Univ. Toronto, dep. computer sci., Toronto ON M5S 1A4, United States
ISSN:
0020-0190
Rights:
Copyright 1993 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Computer science; theoretical automation; systems
Accession Number:
edscal.4802720
Database:
PASCAL Archive
Weitere Informationen
Union trees are rooted trees formed in performing a sequence of disjoint-set union operations, where a union rule can be generally described by a function f. In this paper, a polynomial-time algorithm is presented that recognizes f-union trees for any polynomial-time computable monotone function f. Furthermore, a linear-time implementation of the algorithm is given for linear and monotone functions, which includes the two well-known functions - size and rank.