Kimikazu Kawaguchi

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
A communication network G is considered in which a limited number of link and/or node faults F might occur. A routing rho for the network (a fixed path between each pair of nodes) must be chosen without knowing which components might become faulty. The diameter of the surviving route graph R(G, rho )/F (denoted by (D(R(G, rho )/F))), where two nonfaulty(More)
  • 1