Sciweavers

28 search results - page 6 / 6
» csr 2008
Sort
View
CSR
2008
Springer
13 years 6 months ago
Comparing Universal Covers in Polynomial Time
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...
Jirí Fiala, Daniël Paulusma
HICSS
2008
IEEE
116views Biometrics» more  HICSS 2008»
13 years 11 months ago
Web Accessibility for the Blind: Corporate Social Responsibility or Litigation Avoidance?
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...
Jonathan Frank
CSR
2008
Springer
13 years 4 months ago
Colouring, constraint satisfaction, and complexity
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...
Pavol Hell, Jaroslav Nesetril