1199 search results - page 171 / 240 » Graph Theory |
116
Voted
TIT
2008
15 years 3 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...
106
Voted
SSS
2010
Springer
15 years 2 months ago
2010
Springer
The earlier work on predicate detection has assumed that the given computation is finite. Detecting violation of a liveness predicate requires that the predicate be evaluated on a...
135
Voted
SOCIALCOM
2010
15 years 1 months ago
2010
It is a widely held belief among designers of social tagging systems that tag clouds represent a useful tool for navigation. This is evident in, for example, the increasing number ...
130
click to vote
DAC
2005
ACM
16 years 4 months ago
2005
ACM
SAT (Boolean satisfiability) has become the primary Boolean reasoning engine for many EDA applications, so the efficiency of SAT solving is of great practical importance. Recently...
126
Voted
WWW
2004
ACM
16 years 4 months ago
2004
ACM
Although the OWL Web Ontology Language adds considerable expressive power to the Semantic Web it does have expressive limitations, particularly with respect to what can be said ab...