Hypernetworks in a directed hypergraph
Hypernetworks in a directed hypergraph
复制标题
DOI：
10.1016/j.ejor.2007.04.023
复制
发表时间：
2008-07
期刊：
影响因子：
--
通讯作者：
A. Volpentesta
中科院分区：
文献类型：
--
作者：
A. Volpentesta
Recently novel distributed approaches to the formation of collaborative networked organizations have been proposed. Some of them make use of logical–formal structures (i.e., hypernetworks and hyperpaths) based on concepts related to directed hypergraphs in order to formally represent competitive inter-cluster and collaborative intra-cluster relationships. In this paper, we introduce the concepts of Moreover, we present characterization theorems for both structures, a polynomial algorithm to determine the s-hypernetwork and some conditions under which the problem of finding the (s,d)-hypernetwork is solvable in polynomial time.
