کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
482909 1446172 2008 16 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Hypernetworks in a directed hypergraph
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر علوم کامپیوتر (عمومی)
پیش نمایش صفحه اول مقاله
Hypernetworks in a directed hypergraph
چکیده انگلیسی

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
• the s-hypernetwork, the structure consisting of all hyperpaths from a node s to any node in a directed hypergraph;
• the (s, d)-hypernetwork, the structure consisting of all hyperpaths from a node s to a node d in a directed hypergraph.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.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: European Journal of Operational Research - Volume 188, Issue 2, 16 July 2008, Pages 390–405
نویسندگان
,