Multitree

The butterfly network, a multitree used in distributed computation, showing in red the undirected tree induced by the subgraph reachable from one of its vertices.

In combinatorics and order theory, a multitree may describe either of two equivalent structures: a directed acyclic graph (DAG) in which there is at most one directed path between any two vertices, or equivalently in which the subgraph reachable from any vertex induces an undirected tree, or a partially ordered set (poset) 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]).

In 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.[2]

Multitrees may be used to represent multiple overlapping taxonomies over the same ground set.[3] 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.[4]

  1. ^ Griggs, Jerrold R.; Li, Wei-Tian; Lu, Linyuan (2010), Diamond-free families, arXiv:1010.5311, Bibcode:2010arXiv1010.5311G.
  2. ^ Allender, Eric; Lange, Klaus-Jörn (1996), "StUSPACE(log n) ⊆ DSPACE(log2 n/log log n)", Algorithms and Computation, 7th International Symposium, ISAAC '96, Osaka, Japan, December 16–18, 1996, Proceedings, Lecture Notes in Computer Science, vol. 1178, Springer-Verlag, pp. 193–202, doi:10.1007/BFb0009495.
  3. ^ Furnas, George W.; Zacks, Jeff (1994), "Multitrees: enriching and reusing hierarchical structure", Proc. SIGCHI conference on Human Factors in Computing Systems (CHI '94), pp. 330–336, doi:10.1145/191666.191778, S2CID 18710118.
  4. ^ McGuffin, Michael J.; Balakrishnan, Ravin (2005), "Interactive visualization of genealogical graphs", IEEE Symposium on Information Visualization, Los Alamitos, California, US: IEEE Computer Society, p. 3, doi:10.1109/INFOVIS.2005.22, S2CID 15449409.