201 search results - page 11 / 41 » The Connectivity of addition Cayley graphs |
INFOCOM
2006
IEEE
14 years 1 months ago
2006
IEEE
Abstract— The topological structure of the Internet infrastructure is an important and interesting subject that attracted significant research attention in the last few years. A...
FOCS
1999
IEEE
13 years 11 months ago
1999
IEEE
We consider the DIRECTED STEINER NETWORK problem, also called the POINT-TO-POINT CONNECTION problem, where given a directed graph G and p pairs {(s1,t1),...,(sp,tp)} of nodes in t...
ICALP
2007
Springer
14 years 1 months ago
2007
Springer
A spanner of an undirected unweighted graph is a subgraph that approximates the distance metric of the original graph with some specified accuracy. Specifically, we say H ⊆ G i...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
In this paper, motivated by network inference and tomography applications, we study the problem of compressive sensing for sparse signal vectors over graphs. In particular, we are ...
SODA
2012
ACM
11 years 9 months ago
2012
ACM
The Directed Steiner Tree (DST) problem is a cornerstone problem in network design. We focus on the generalization of the problem with higher connectivity requirements. The proble...