18 search results - page 1 / 4 » Covering codes in Sierpinski graphs |
DMTCS
2010
13 years 2 months ago
2010
TIT
2008
13 years 4 months ago
2008
The identifying code problem for a given graph involves finding a minimum set of vertices whose neighborhoods uniquely overlap at any given graph vertex. Initially introduced in 1...
CORR
2010
Springer
13 years 1 months ago
2010
Springer
We present a combinatorial characterization of the Bethe entropy function of a factor graph, such a characterization being in contrast to the original, analytical, definition of th...
TIT
1998
13 years 4 months ago
1998
—We investigate a new class of codes for the optimal covering of vertices in an undirected graph Gsuch that any vertex in G can be uniquely identified by examining the vertices ...
DAM
2011
12 years 11 months ago
2011
An edge-labeling λ for a directed graph G has a weak sense of direction (WSD) if there is a function f that satisfies the condition that for any node u and for any two label seq...