3958 search results - page 14 / 792 » Dynamic Graph Algorithms with Applications |
113
click to vote
SODA
2004
ACM
15 years 3 months ago
2004
ACM
We solve an open problem posed by Eppstein in 1995 [14, 15] and re-enforced by Grohe [16, 17] concerning locally bounded treewidth in minor-closed families of graphs. A graph has ...
116
Voted
GC
2004
Springer
15 years 7 months ago
2004
Springer
This paper presents a locality-based dissemination graph algorithm for scalable reliable broadcast. Our algorithm scales in terms of both network and memory usage. Processes only h...
136
click to vote
IFM
2009
Springer
15 years 2 days ago
2009
Springer
Abstract. A communication system evolves dynamically with the addition and deletion of services. In our previous work [12], a graph transformation system (GTS) was used to model th...
115
Voted
CONEXT
2009
ACM
15 years 3 months ago
2009
ACM
Network traffic can be represented by a Traffic Dispersion Graph (TDG) that contains an edge between two nodes that send a particular type of traffic (e.g., DNS) to one another. T...
115
click to vote
DICS
2006
15 years 6 months ago
2006
Dynamic Parallel Schedules (DPS) is a flow graph based framework for developing parallel applications on clusters of workstations. The DPS flow graph execution model enables automa...