230 search results - page 3 / 46 » Time Varying Undirected Graphs |
TVCG
2012
11 years 9 months ago
2012
—We present a new approach for time-varying graph drawing that achieves both spatiotemporal coherence and multifocus+context visualization in a single framework. Our approach uti...
SIGMETRICS
2012
ACM
11 years 9 months ago
2012
ACM
In this paper we study the behavior of a continuous time random walk (CTRW) on a stationary and ergodic time varying dynamic graph. We establish conditions under which the CTRW is...
ESA
2004
Springer
14 years 24 days ago
2004
Springer
We obtain the following results related to dynamic versions of the shortest-paths problem: (i) Reductions that show that the incremental and decremental singlesource shortest-paths...
ICALP
1994
Springer
13 years 11 months ago
1994
Springer
We describe efficient algorithms for finding even cycles in undirected graphs. Our main results are the following: (i) For every k 2, there is an O(V 2) time algorithm that decide...
CSR
2009
Springer
14 years 2 months ago
2009
Springer
A homomorphism from a graph G to a graph H (in this paper, both simple, undirected graphs) is a mapping f : V (G) → V (H) such that if uv ∈ E(G) then f(u)f(v) ∈ E(H). The pro...