1221 search results - page 157 / 245 » Balanced graph partitioning |
COCOON
2010
Springer
14 years 2 months ago
2010
Springer
In the Imbalance Minimization problem we are given a graph G = (V, E) and an integer b and asked whether there is an ordering v1 . . . vn of V such that the sum of the imbalance of...
CORR
2012
Springer
12 years 5 months ago
2012
Springer
A h-uniform hypergraph H = (V, E) is called ( , k)-orientable if there exists an assignment of each hyperedge e ∈ E to exactly of its vertices v ∈ e such that no vertex is ass...
KDD
2007
ACM
14 years 10 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...
INFOCOM
2009
IEEE
14 years 4 months ago
2009
IEEE
—Greedy routing is a novel routing paradigm where messages are always forwarded to the neighbor that is closest to the destination. Our main result is a polynomial-time algorithm...
JUCS
2002
13 years 9 months ago
2002
: Let G = (V, E) be a strongly connected and aperiodic directed graph of uniform out-degree k. A deterministic finite automaton is obtained if the edges are colored with k colors i...