Distance-2 edge coloring is NPcomplete (2008)
Jeff Erickson, Shripad Thite, David Bunde
Let G be a simple, undirected graph. We say that two edges of G are within distance 2 of each other if either they are adjacent or there is some other edge that is adjacent to both of them. A...
Lecturer Je, Erickson Scribe, David Bunde, Splay Trees
In this lecture, we describe splay trees, a data structure developed by Sleator and Tarjan [1] which supports insert, delete, nd, split, and merge operations in logarithmic amortized time. We show...