3958 search results - page 9 / 792 » Dynamic Graph Algorithms with Applications |
103
click to vote
WG
2009
Springer
15 years 4 months ago
2009
Springer
We present a fully dynamic algorithm that maintains three different representations of an interval graph: a minimal interval model of the graph, the PQ-tree of its maximal cliques...
ICC
2009
IEEE
15 years 4 months ago
2009
IEEE
A graph-based framework for dynamic fractional frequency reuse (FFR) in multi-cell OFDMA networks is proposed in this work. FFR is a promising resource allocation technique that c...
ESOP
2006
Springer
15 years 1 months ago
2006
Springer
We present and solve a path optimization problem on programs. Given a set of program nodes, called critical nodes, we find a shortest path through the program's control flow g...
KDD
2009
ACM
15 years 10 months ago
2009
ACM
Algorithms based on simulating stochastic flows are a simple and natural solution for the problem of clustering graphs, but their widespread use has been hampered by their lack of...
KDD
2007
ACM
15 years 10 months ago
2007
ACM
How can we find communities in dynamic networks of social interactions, such as who calls whom, who emails whom, or who sells to whom? How can we spot discontinuity timepoints in ...