| | |
Summary: Storage capacity of labeled graphs
Dana Angluin1
, James Aspnes1
, Rida A. Bazzi2
, Jiang Chen3
, David
Eisenstat4
, and Goran Konjevod2
1
Department of Computer Science, Yale University
2
Department of Computer Science and Engineering, Arizona State University
3
Google
4
Department of Computer Science, Brown University
Abstract. 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 labelings are not distin-
guishable. An exact information-theoretic bound is easily obtained by
|
