22 search results - page 5 / 5 » Hamilton Cycles in Random Lifts of Directed Graphs |
IEEESCC
2009
IEEE
13 years 3 months ago
2009
IEEE
In this paper we look at combining and compressing a set of workflows, such that computation can be minimized. In this context, we look at two novel theoretical problems with appl...
WAW
2007
Springer
13 years 11 months ago
2007
Springer
Popular reputation systems for linked networks can be manipulated by spammers who strategically place links. The reputation of node v is interpreted as the world’s opinion of vâ...