230 search results - page 19 / 46 » Time Varying Undirected Graphs |
123
Voted
TCS
2008
15 years 3 months ago
2008
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...
140
Voted
COMPGEOM
2010
ACM
15 years 8 months ago
2010
ACM
Let D be a weighted directed graph cellularly embedded in a surface of genus g, orientable or not, possibly with boundary. We describe algorithms to compute a shortest non-contrac...
108
click to vote
ICALP
2010
Springer
15 years 8 months ago
2010
Springer
We consider the problem of efficiently finding an additive C-spanner of an undirected unweighted graph G, that is, a subgraph H so that for all pairs of vertices u, v, δH (u, v) ...
216
Voted
ICALP
2011
Springer
14 years 7 months ago
2011
Springer
Given an unlabeled, unweighted, and undirected graph with n vertices and small (but not necessarily constant) treewidth k, we consider the problem of preprocessing the graph to bui...
135
click to vote
MFCS
2009
Springer
15 years 10 months ago
2009
Springer
We investigate the computational complexity of a general “compression task” centrally occurring in the recently developed technique of iterative compression for exactly solving...