1162 search results - page 96 / 233 » Minimum Cycle Bases in Graphs Algorithms and Applications |
ICPP
2008
IEEE
14 years 2 months ago
2008
IEEE
—We consider resource allocation for distributed streaming applications running in a grid environment, where continuously streaming data needs to be aggregated and processed to p...
CIE
2007
Springer
14 years 2 months ago
2007
Springer
In the framework of parameterized complexity, exploring how one parameter affects the complexity of a different parameterized (or unparameterized problem) is of general interest....
KDD
2007
ACM
14 years 8 months ago
2007
ACM
In this paper, we design recommender systems for weblogs based on the link structure among them. We propose algorithms based on refined random walks and spectral methods. First, w...
CGF
1998
13 years 8 months ago
1998
In contrast with the growth of plants and trees, human organs can undergo signi cant changes in shape through a variety of global transformations during the growth period, such as...
ANOR
2005
13 years 8 months ago
2005
In Hell et al. (2004), we have previously observed that, in a chordal graph G, the maximum number of independent r-cliques (i.e., of vertex disjoint subgraphs of G, each isomorphic...