Abstract
Several modern systems have hierarchies of classes of objects, where each class may be a member of more than one higher-level class. If the hierarchy forms a tree (or forest), we can test class membership efficiently by labeling each leaf with an integer and each higher-level class with a pair of integers such that a leaf is in a class if and only if its label is in the range defined by the class label. Such labelings are not possible for arbitrary hierarchies. This article shows how to apply an algorithm from graph theory to determine such a labeling, if it exists, for a given hierarchy. If the algorithm fails to find a labeling, then no labeling exists.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
