406 search results - page 2 / 82 » Identifying Codes and Covering Problems |
ICST
2010
IEEE
13 years 3 months ago
2010
IEEE
—Mutation testing measures the adequacy of a test suite by seeding artificial defects (mutations) into a program. If a test suite fails to detect a mutation, it may also fail to...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
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...
COLING
1996
13 years 6 months ago
1996
This paper proposes a new algorithm that simultaneously identifies the coding system and language of a code string fetched from the Internet, especially World-Wide Web. The algori...
LREC
2010
13 years 6 months ago
2010
As the data for more and more languages is finding its way into digital form, with an increasing amount of this data being posted to the Web, it has become possible to collect lan...
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 ...