28 search results - page 1 / 6 » Approximability of identifying codes and locating-dominating... |
IPL
2007
13 years 4 months ago
2007
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 ...
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...
ACSD
1998
IEEE
13 years 9 months ago
1998
IEEE
State coding conflict detection is a fundamental part of synthesis of asynchronous concurrent systems from their specifications as Signal Transition Graphs (STGs), which are a spe...
TIT
2002
13 years 4 months ago
2002
This paper provides a mathematical analysis of transform compression in its relationship to linear and nonlinear approximation theory. Contrasting linear and nonlinear approximatio...
BROADNETS
2007
IEEE
13 years 11 months ago
2007
IEEE
Wireless Sensor Networks (WSNs) provide an important means of monitoring the physical world, but their ons present challenges to fundamental network services such as routing. In t...