3958 search results - page 197 / 792 » Dynamic Graph Algorithms with Applications |
196
click to vote
ICDCS
2002
IEEE
15 years 11 months ago
2002
IEEE
The need for sharing is well known in a large number of distributed collaborative applications. These applications are difficult to develop for wide area (possibly mobile) networ...
165
click to vote
ICDM
2009
IEEE
16 years 1 months ago
2009
IEEE
—Applying the concept of organizational structure to social network analysis may well represent the power of members and the scope of their power in a social network. In this pap...
170
click to vote
KDD
2007
ACM
16 years 7 months ago
2007
ACM
Network clustering (or graph partitioning) is an important task for the discovery of underlying structures in networks. Many algorithms find clusters by maximizing the number of i...
206
click to vote
JAIR
2010
15 years 1 months ago
2010
The Hamiltonian cycle problem (HCP) is an important combinatorial problem with applications in many areas. It is among the first problems used for studying intrinsic properties, i...
189
click to vote
ESA
2009
Springer
16 years 1 months ago
2009
Springer
Consider the robust network design problem of finding a minimum cost network with enough capacity to route all traffic demand matrices in a given polytope. We investigate the impa...