553 search results - page 23 / 111 » Cover Contact Graphs |
158
Voted
IH
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. Statistical disclosure is a well-studied technique that an attacker can use to uncover relations between users in mix-based anonymity systems. Prior work has focused on f...
162
click to vote
ICALP
2004
Springer
15 years 9 months ago
2004
Springer
We study graph orientations that minimize the entropy of the in-degree sequence. The problem of finding such an orientation is an interesting special case of the minimum entropy ...
146
click to vote
FOCS
2009
IEEE
15 years 10 months ago
2009
IEEE
Abstract— We give approximation algorithms for the Generalized Steiner Network (GSN) problem. The input consists of a graph
187
click to vote
DAM
2011
14 years 11 months ago
2011
We study various optimization problems in t-subtree graphs, the intersection graphs of tsubtrees, where a t-subtree is the union of t disjoint subtrees of some tree. This graph cl...
147
click to vote
WG
2007
Springer
15 years 10 months ago
2007
Springer
A cycle cover of a graph is a set of cycles such that every vertex is part of exactly one cycle. An L-cycle cover is a cycle cover in which the length of every cycle is in the set ...