Sciweavers

11381 search results - page 110 / 2277
» Connectivity
Sort
View
127
Voted
SCN
2008
Springer
128views Communications» more  SCN 2008»
15 years 3 months ago
On Linear Secret Sharing for Connectivity in Directed Graphs
In this work we study linear secret sharing schemes for s-t connectivity in directed graphs. In such schemes the parties are edges of a complete directed graph, and a set of partie...
Amos Beimel, Anat Paskin
168
Voted
GLOBECOM
2010
IEEE
15 years 25 days ago
A Controlled Coalitional Game for Wireless Connection Sharing and Bandwidth Allocation in Mobile Social Networks
Mobile social networks have been introduced as a new efficient (i.e., minimize resource usage) and effective (i.e., maximize the number of target recipients) way to disseminate con...
Dusit Niyato, Zhu Han, Walid Saad, Are Hjør...
170
Voted
KDD
2012
ACM
226views Data Mining» more  KDD 2012»
13 years 5 months ago
TourViz: interactive visualization of connection pathways in large graphs
We present TOURVIZ, a system that helps its users to interactively visualize and make sense in large network datasets. In particular, it takes as input a set of nodes the user spe...
Duen Horng Chau, Leman Akoglu, Jilles Vreeken, Han...
148
Voted
SODA
2012
ACM
218views Algorithms» more  SODA 2012»
13 years 5 months ago
Linear kernels for (connected) dominating set on H-minor-free graphs
We give the first linear kernels for DOMINATING SET and CONNECTED DOMINATING SET problems on graphs excluding a fixed graph H as a minor. In other words, we give polynomial time...
Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, ...
161
Voted
SAS
2012
Springer
226views Formal Methods» more  SAS 2012»
13 years 5 months ago
A Structural Soundness Proof for Shivers's Escape Technique - A Case for Galois Connections
Abstract. Shivers’s escape technique enables one to analyse the control flow of higher-order program fragments. It is widely used, but its soundness has never been proven. In th...
Jan Midtgaard, Michael D. Adams 0001, Matthew Migh...