Abstract
AbstractOne of the interesting issues in the management of large computer networks is to partition the network into clusters and then to perform the management for each cluster. This paper presents a basic discussion on the initial clustering problem for a given network. the initial clustering problem C is defined as follows. Given a graphic representation G=(V, E), [V] = n of a network and a set of nodes C=[ci]1≤ i ≤ m ≤ V, the graph G is to be partitioned into m connected subgraphs Gi = (V≤ E≤) ( 1 ≤ i ≤ m) of G satisfying the following conditions: ≤ V, ≤ (a positive integer); and ≤ the distance between ≤ Vi and ≤ is minimum when × = i. the following results were obtained for the time complexity of the problem C: (1) the initial clustering problem C is in general NP‐hard; and (2) the sub‐problem obtained by deleting the condition ≤ can be solved in O (n2).
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Electronics and Communications in Japan (Part III: Fundamental Electronic Science)
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
