Given a resistive electrical network, we would like to determine whether all the resistances (edges) in the network are working, and if not, identify which edge (or edges) are faulty. To make this determination, we are allowed to measure the effective resistance between certain pairs of nodes (which can be done by measuring the amount of current when one unit of voltage difference is applied at the chosen pair of nodes). The goal is to determine which edge, if any, is not working in the network using the smallest number of measurements. We prove rigorous upper and lower bounds on this optimal number of measurements for different classes of graphs. These bounds are tight for several of these classes showing that our measurement strategies are optimal.

翻译：给定一个电阻网络，我们希望确定网络中所有电阻（边）是否正常工作，若非如此，则识别出故障边（或边集）。为进行判定，我们允许测量特定节点对之间的等效电阻（可通过在选定节点对上施加单位电压差并测量电流值实现）。目标是以最少的测量次数确定网络中是否存在故障边及其位置。我们针对不同图类证明了该最优测量次数的严格上界与下界。对于其中多类图，这些界是紧致的，表明我们的测量策略具有最优性。