Efficient partition trees
نویسندگان
چکیده
منابع مشابه
Efficient Partition Trees for Range Searching
We have seen the use of partition trees for range searching earlier. In this lecture an efficient partition scheme which achieves the optimal query time within polylog factors is described. See [4] and [5] for more details. There are several new ideas on which this scheme relies. The existence of “good” cuttings are central to the algorithm. In the next section some of the definitions and resul...
متن کاملGlobal Alliance Partition in Trees
Let G be a connected graph with vertex set V (G) and edge set E(G). A (defensive) alliance in G is a subset S of V (G) such that for every vertex v ∈ S, |N [v]∩S| ≥ |N(v)∩(V (G)− S)|. The alliance partition number, ψa(G), was defined (and further studied in [11]) to be the maximum number of sets in a partition of V (G) such that each set is a (defensive) alliance. Similarly, ψg(G) is the maximu...
متن کاملEfficient Coalgebraic Partition Refinement
We present a generic partition refinement algorithm that quotients coalgebraic systems by behavioural equivalence, an important task in reactive verification; coalgebraic generality implies in particular that we cover not only classical relational systems but also various forms of weighted systems. Under assumptions on the type functor that allow representing its finite coalgebras in terms of n...
متن کاملOn the partition dimension of trees
Given an ordered partition Π = {P1, P2, ..., Pt} of the vertex set V of a connected graph G = (V,E), the partition representation of a vertex v ∈ V with respect to the partition Π is the vector r(v|Π) = (d(v, P1), d(v, P2), ..., d(v, Pt)), where d(v, Pi) represents the distance between the vertex v and the set Pi. A partition Π of V is a resolving partition of G if different vertices of G have ...
متن کاملA canonical partition theorem for trees
We show that for every positive integer d, every downwards closed subtree T of d without terminal nodes and every finite weakly embedded subtree A of T there is a finite list of equivalence relations on Em(T ) with the property that for every other equivalence relation E on Em(T ) there is a strongly embedded subtree S ⊆ T of height ω, such that E Em(S) is equal to one of the equivalence relati...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete & Computational Geometry
سال: 1992
ISSN: 0179-5376,1432-0444
DOI: 10.1007/bf02293051