Broken resistors and z-sequence descent

Kjell Konis
Jeff Mermin
Derek Newland

1. Introduction
1.1. Resistor networks
1.2. Medial graphs
1.3. Corruption
2. Notation
3. Finding Corrupted Resistors
3.1. Simple uncrossings and supercritical graphs
3.2. Multiple or non-simple uncrossings
4. The Critical Path Theorem
4.1. Delensing
4.2. Critical Delensing
4.3. The Critical Path Theorem
4.4. Consequences
5. Recovering corrupted resistors, revisited
5.1. Only one uncrossed resistor
6. z-sequence descent
6.1. A useful algorithm
6.2. Examples