The classical matrix-tree theorem relates the determinant of the combinatorial Laplacian on a graph to the number of spanning trees. We generalize this result to Laplacians on one- and two-dimensional ...

Jeff Hardee introduced me to the idea of using longer Spanning Tree Protocol (STP) path length values for high-speed links. I thought this was an intriguing idea and so I started to do some informal ...

The use of switched network environments to forward digital data transmission packets known as frames is a very basic concept in networking and telecommunications. Network switches work to direct ...