(definition)
Definition: A connection between any number of vertices of a hypergraph.
Formal Definition: A hyperedge is a set of vertices of a hypergraph.
Aggregate parent (I am a part of or used in ...)
hypergraph.
See also edge, graph, directed graph, undirected graph, weighted graph.
Author: PEB
If you have suggestions, corrections, or comments, please get in touch with Paul E. Black.
Entry modified Thu Nov 3 08:32:59 2005.
HTML page formatted Mon Dec 19 14:07:48 2005.
Cite this as:
Paul E. Black, "hyperedge", from
Dictionary of Algorithms and Data
Structures, Paul E. Black, ed.,
NIST.
http://www.nist.gov/dads/HTML/hyperedge.html
