TOPICS
Search

Hyperstring


A hyperstring is a simple semi-Hamiltonian acyclic digraph (V,E) with a labeling of the edges in E such that, for all vertices i,j,p,q in V, either pi(i,j)=pi(p,q) or pi(i,j) intersection pi(p,q)=emptyset, where a set pi(v_1,v_2) is the set of label strings represented by the paths (v_1,...,v_2).


See also

Acyclic Digraph, Transparallel Processing

This entry contributed by Peter van der Helm

Explore with Wolfram|Alpha

References

van der Helm, P. A. "Transparallel Processing by Hyperstrings." Proc. Nat. Acad. Sci. USA 101, 10862-10867, 2004.

Referenced on Wolfram|Alpha

Hyperstring

Cite this as:

van der Helm, Peter. "Hyperstring." From MathWorld--A Wolfram Web Resource, created by Eric W. Weisstein. https://mathworld.wolfram.com/Hyperstring.html

Subject classifications