The universal cover TG of a connected graph G is the unique (possible infinite) tree covering G, i.e., that allows a locally bijective homomorphism from TG to G. Universal covers h...
On September 5, 2006, a legal precedent was set for web accessibility. Federal judge Marilyn Patel sustained discrimination claims by the National Federation for the Blind against...
Constraint satisfaction problems have enjoyed much attention since the early seventies, and in the last decade have become also a focus of attention amongst theoreticians. Graph c...