Finding hypernetworks in directed hypergraphs

The term “hypernetwork” (more precisely, s-hypernetwork and (s, d)-hypernetwork) has been recently adopted to denote some logical structures contained in a directed hypergraph. A hypernetwork identifies the core of a hypergraph model, obtained by filtering off redundant components. Therefore, finding hypernetworks has a notable relevance both from a theoretical and from a computational point of view.

MoreLess

Year of publication:	2013
Authors:	Pretolani, Daniele
Published in:	European Journal of Operational Research. - Elsevier, ISSN 0377-2217. - Vol. 230.2013, 2, p. 226-230
Publisher:	Elsevier
Subject:	Graph theory \| Directed hypergraphs \| Hyperpaths

More details

Type of publication:	Article
Source:	RePEc - Research Papers in Economics

Persistent link: https://ebvufind01.dmz1.zbw.eu/10011052670