Graphs and Hypergraphs

By D. Simovici, C. Djeraba. 2008

468 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Recommender Systems (2012, methodology): “To resolve this, hypergraph [85] can be used to give an exact representation of the full structure of a collaborative tagging system.”
Hamilton cycles in graphs and hypergraphs: an extremal perspective (2014, background): “A Berge cycle v1, e1, v2, . . . , vn, en is a Hamilton Berge cycle of a hypergraph G if V (G) = {v1, . . . , vn} and ei ∈ E(G) for each i ≤ n.”
Subgraph centrality and clustering in complex hyper-networks (2005, background): “In the study of connectivity, clustering and other topological properties, this distinction between two classes of nodes with completely different interpretations may lead to artifacts in the data [18].”