How many systems are there?—using the N 2  method for systems partitioning | Zendy

Bustnay Tamir | Zendy; BenAsher Joseph Z. | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Premium

How many systems are there?—using the N 2 method for systems partitioning

Author(s) -

Bustnay Tamir,

BenAsher Joseph Z.

Publication year - 2005

Publication title -

systems engineering

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.474

H-Index - 50

eISSN - 1520-6858

pISSN - 1098-1241

DOI - 10.1002/sys.20023

Subject(s) - computer science , graph theory , graph , graph partition , algorithm , simple (philosophy) , theoretical computer science , mathematical optimization , mathematics , philosophy , epistemology , combinatorics

An algorithm for partitioning a complex system into its independent constituents is developed. The N 2 method is used for the problem formulation whereby the objective is to obtain a system presentation in a simple flow. The development of the algorithm is based on graph theory techniques. The algorithm is formulated using graph theory and N 2 charts. Several examples are presented to demonstrate the relative ease of the algorithm employment. © 2005 Wiley Periodicals, Inc. Syst Eng 8: 109–118, 2005

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here

Accelerating Research