1215 search results - page 139 / 243 » Combinatorics |
103
Voted
COMBINATORICS
2007
15 years 3 months ago
2007
This work introduces the technique of using a carefully chosen determining set to prove the existence of a distinguishing labeling using few labels. A graph G is said to be d-dist...
95
Voted
FOCS
2009
IEEE
15 years 10 months ago
2009
IEEE
We extend the “method of multiplicities” to get the following results, of interest in combinatorics and randomness extraction.
104
Voted
COCOON
2007
Springer
15 years 9 months ago
2007
Springer
We use the connection between resource-bounded dimension and the online mistake-bound model of learning to show that the following classes have polynomial-time dimension zero.
122
Voted
DM
2008
15 years 3 months ago
2008
: Gould, Jacobson and Lehel (Combinatorics, Graph Theory and Algorithms, Vol.I (1999) 451
125
Voted
COMBINATORICS
2004
15 years 3 months ago
2004
We consider the Goldberg-Coxeter construction GCk,l(G0) (a generalization of a simplicial subdivision of the dodecahedron considered in [Gold37] and [Cox71]), which produces a pla...