#jsDisabledContent { display:none; } My Account |  Register |  Help

# Multitree

Article Id: WHEBN0027131455
Reproduction Date:

 Title: Multitree Author: World Heritage Encyclopedia Language: English Subject: Collection: Publisher: World Heritage Encyclopedia Publication Date:

### Multitree

The butterfly network, a multitree used in distributed computation, showing the subtree reachable from one of its nodes

In combinatorics and order-theoretic mathematics, a multitree may describe either of two equivalent structures: a directed acyclic graph in which the set of nodes reachable from any node form a tree, or a partially ordered set that does not have four items a, b, c, and d forming a diamond suborder with abd and acd but with b and c incomparable to each other (also called a diamond-free poset[1]).

## Contents

• Equivalence between directed acyclic graph and poset definitions 1
• Diamond-free families 2
• Applications 3
• Related structures 4
• References 5

## Equivalence between directed acyclic graph and poset definitions

If G is a directed acyclic graph ("DAG") in which the nodes reachable from each vertex form a tree (or equivalently, if G is a directed graph in which there is at most one directed path between any two nodes, in either direction) then the reachability relation in G forms a diamond-free partial order. Conversely, if P is a diamond-free partial order, its transitive reduction forms a DAG in which the successors of any node form a tree.

## Diamond-free families

A diamond-free family of sets is a family F of sets whose inclusion ordering forms a diamond-free poset. If D(n) denotes the largest possible diamond-free family of subsets of an n-element set, then it is known that

2\le \lim_{n\to\infty} D(n) \Big/ \binom{n}{\lfloor n/2\rfloor}\le 2\frac{3}{11}

and it is conjectured that the limit is 2.[1]

## Applications

Multitrees may be used to represent multiple overlapping taxonomies over the same ground set.[2] If a family tree may contain multiple marriages from one family to another, but does not contain marriages between any two blood relatives, then it forms a multitree.[3] In the context of computational complexity theory, multitrees have also been called strongly unambiguous graphs or mangroves; they can be used to model nondeterministic algorithms in which there is at most one computational path connecting any two states.[4]

## Related structures

A polytree, a directed acyclic graph formed by assigning an orientation to each edge of an undirected tree, may be viewed as a special case of a multitree.

The set of all nodes connected to any node u in a multitree forms an arborescence.

The word "multitree" has also been used to refer to a series-parallel partial order,[5] or to other structures formed by combining multiple trees.

## References

1. ^ a b Griggs, Jerrold R.; Li, Wei-Tian; Lu, Linyuan (2010), Diamond-free families, .
2. ^ .
3. ^ McGuffin, Michael J.; Balakrishnan, Ravin (2005), "Interactive visualization of genealogical graphs", IEEE Symposium on Information Visualization, Los Alamitos, CA, USA: IEEE Computer Society, pp. 3–3, .
4. ^ .
5. ^ Jung, H. A. (1978), "On a class of posets and the corresponding comparability graphs", .
This article was sourced from Creative Commons Attribution-ShareAlike License; additional terms may apply. World Heritage Encyclopedia content is assembled from numerous content providers, Open Access Publishing, and in compliance with The Fair Access to Science and Technology Research Act (FASTR), Wikimedia Foundation, Inc., Public Library of Science, The Encyclopedia of Life, Open Book Publishers (OBP), PubMed, U.S. National Library of Medicine, National Center for Biotechnology Information, U.S. National Library of Medicine, National Institutes of Health (NIH), U.S. Department of Health & Human Services, and USA.gov, which sources content from all federal, state, local, tribal, and territorial government publication portals (.gov, .mil, .edu). Funding for USA.gov and content contributors is made possible from the U.S. Congress, E-Government Act of 2002.

Crowd sourced content that is contributed to World Heritage Encyclopedia is peer reviewed and edited by our editorial staff to ensure quality scholarly research articles.