文章基本信息

标题：AN EFFICIENT ALGORITHM FOR INFORMATION SYSTEM DECOMPOSITION
本地全文：下载
作者：Lovrenčić, Alen
期刊名称：Journal of Information and Organizational Sciences
印刷版ISSN：1846-3312
电子版ISSN：1846-9418
出版年度：1998
卷号：22
期号：2
页码：137-150
出版社：Faculty of Organization and Informatics University of Zagreb
摘要：A general context for the problem of decomposition within an information system is described in [3]. The problem has been classified as a NP-complete problem, which excludes the possibility of an optimal solution of the problem in polynomial time. This paper has two goals: first, to solve the problem with in some additional limitations that are usual in the praxis of decomposition and, second, to provide for an on average faster algorithm to calculate the optimal decomposition of an information system into subsystems.
关键词：information systems; algorithm; optimization; complexity