Title :
Optimal coteries for rings and related networks
Author :
Ibaraki, Toshihide ; Nagamochi, Hiroshi ; Kameda, Tiko
Author_Institution :
Dept. of Appl. Math. & Phys., Kyoto Univ., Japan
Abstract :
Although finding an optimal coterie for a general graph G is computationally intractable, it is shown that it can be easily found if G is a ring. Since the solution is already known when G is a complete graph, it is implied that an optimal coterie can be obtained if every biconnected component of G consists of a single edge, a ring, or a complete graph
Keywords :
protocols; token networks; biconnected component; complete graph; general graph; optimal coteries; rings; Availability; Bidirectional control; Distributed computing; Electrical capacitance tomography; Physics computing; Polynomials;
Conference_Titel :
Distributed Computing Systems, 1992., Proceedings of the 12th International Conference on
Conference_Location :
Yokohama
Print_ISBN :
0-8186-2865-0
DOI :
10.1109/ICDCS.1992.235109
