A Graph Theoretic Problem on Local Area Network Design
Tadashi Ae, Reiji Aibara, Wagner Chiepa Cunha, Kaori Hayashihara · Hiroshima University Acedemic Information Repository (Hiroshima University) · 1985
1. IntrodiLictian In this paper we fiocus on a graph theoiretic prcfolrelated to the design of a local ar<ne加〇-rk( in short工一AN ) illustrated as in Fig.1' 地re the computing devices are sep汀ated into the user layer and the server layer. These two layers correspond to the work statioins and the resoL江CeS, respectively. The I*相可plays a role of interconnection btween加Iayers. A virtual ccntputer syst<甘n foor a user can be