- bounded tree
- A tree marking a corner of a tract of land. See boundary trees.
Ballentine's law dictionary. Anderson, W.S.. 1998.
bounded tree
Look at other dictionaries:
bounded tree — A tree marking or standing at the corner of a field or estate … Black's law dictionary
bounded tree — A tree marking or standing at the corner of a field or estate … Black's law dictionary
tree — A woody plant with a stem or trunk from which branches spring. 34 Am J1st Logs § 2. A part and parcel of the land in which rooted. 42 Am J1st Prop § 19. An interest in real estate, except as to a tree growing in a nursery and raised to be sold… … Ballentine's law dictionary
Tree conservation areas in Singapore — Tree Conservation Areas are large urban areas in Singapore in which no tree with a girth above 1 metre when measured 50 centimetres from the ground may be felled without permission from the National Parks Board. There are currently two such areas … Wikipedia
Tree decomposition — A graph with eight vertices, and a tree decomposition of it onto a tree with six nodes. Each graph edge connects two vertices that are listed together at some tree node, and each graph vertex is listed at the nodes of a contiguous subtree of the… … Wikipedia
Tree That Owns Itself — The Tree That Owns Itself is a white oak tree, widely assumed to have legal ownership of itself and of all land within eight feet (2.4 m) of its base. The tree is located at the corner of Finley and Dearing Streets in Athens, Georgia, USA. The… … Wikipedia
Decision tree model — In computational complexity and communication complexity theories the decision tree model is the model of computation or communication in which an algorithm or communication process is considered to be basically a decision tree, i.e., a sequence… … Wikipedia
Liberty Tree District — Infobox nrhp | name =Liberty Tree District nrhp type = hd caption = location= Boston, Massachusetts lat degrees = 42 lat minutes = 21 lat seconds = 7 lat direction = N long degrees = 71 long minutes = 3 long seconds = 47 long direction = W… … Wikipedia
Chromatic polynomial — All nonisomorphic graphs on 3 vertices and their chromatic polynomials, clockwise from the top. The independent 3 set: k3. An edge and a single vertex: k2(k − 1). The 3 path: k(k − 1)2. The 3 clique … Wikipedia
Conjunctive query — In database theory, a conjunctive query is a restricted form of first order queries. A large part of queries issued on relational databases can be written as conjunctive queries, and large parts of other first order queries can be written as… … Wikipedia
