Sciweavers

38 search results - page 1 / 8
» Extremal graphs for the identifying code problem
Sort
View
CORR
2010
Springer
92views Education» more  CORR 2010»
13 years 11 months ago
Extremal graphs for the identifying code problem
An identifying code of a graph G is a dominating set C such that every vertex x of G is distinguished from all other vertices by the set of vertices in C that are at distance at m...
Florent Foucaud, Eleonora Guerrini, Matjaz Kovse, ...
IPL
2007
105views more  IPL 2007»
13 years 10 months ago
Approximability of identifying codes and locating-dominating codes
We study the approximability and inapproximability of finding identifying codes and locating-dominating codes of the minimum size. In general graphs, we show that it is possible ...
Jukka Suomela
TIT
2008
122views more  TIT 2008»
13 years 10 months ago
Identifying Codes and Covering Problems
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...
Moshe Laifenfeld, Ari Trachtenberg
TIT
1998
127views more  TIT 1998»
13 years 10 months ago
On a New Class of Codes for Identifying Vertices in Graphs
—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 ...
Mark G. Karpovsky, Krishnendu Chakrabarty, Lev B. ...
SDM
2011
SIAM
242views Data Mining» more  SDM 2011»
13 years 1 months ago
Fast Algorithms for Finding Extremal Sets
Identifying the extremal (minimal and maximal) sets from a collection of sets is an important subproblem in the areas of data-mining and satisfiability checking. For example, ext...
Roberto J. Bayardo, Biswanath Panda