SSS
2010
Springer
13 years 9 months ago
2010
Springer
We consider the question of how much information can be stored by labeling the vertices of a connected undirected graph G using a constant-size set of labels, when isomorphic label...