Coordinated Partitions in Organizational Network Structures

Abstract

This paper consider the coordination problem for the boundaries of control polygons in large-scale network structures; coordination is performed among different types of network partitions into such polygons. We define conditions ensuring smaller control costs in the case where the polygon boundaries of one partition type coincide with those of another partition type. The solution of this class of problems is topical for the analysis of traffic control and infrastructure maintenance in transport networks (particularly, railway networks).