Sciweavers

3204 search results - page 278 / 641
» The b-chromatic Number of a Graph
Sort
View
95
Voted
TCS
2008
15 years 21 days ago
A simple transitive signature scheme for directed trees
Transitive signatures allow a signer to authenticate edges in a graph in such a way that anyone, given the public key and two signatures on adjacent edges (i, j) and (j, k), can c...
Gregory Neven
JSS
2010
89views more  JSS 2010»
14 years 7 months ago
Verification and validation of declarative model-to-model transformations through invariants
In this paper we propose a method to derive OCL invariants from declarative model-to-model transformations in order to enable their verification and analysis. For this purpose we ...
Jordi Cabot, Robert Clarisó, Esther Guerra,...
111
Voted
SIGECOM
2009
ACM
137views ECommerce» more  SIGECOM 2009»
15 years 7 months ago
An exact almost optimal algorithm for target set selection in social networks
The Target Set Selection problem proposed by Kempe, Kleinberg, and Tardos, gives a nice clean combinatorial formulation for many problems arising in economy, sociology, and medicin...
Oren Ben-Zwi, Danny Hermelin, Daniel Lokshtanov, I...
89
Voted
INFOCOM
2008
IEEE
15 years 7 months ago
Reducing Maximum Stretch in Compact Routing
—It is important in communication networks to use routes that are as short as possible (i.e have low stretch) while keeping routing tables small. Recent advances in compact routi...
Mihaela Enachescu, Mei Wang, Ashish Goel
CORR
2006
Springer
119views Education» more  CORR 2006»
15 years 25 days ago
Network Inference from Co-Occurrences
The study of networked systems is an emerging field, impacting almost every area of engineering and science, including the important domains of communication systems, biology, soc...
Michael Rabbat, Mário A. T. Figueiredo, Rob...