3267 search results - page 383 / 654 » Generalized quasirandom graphs |
159
click to vote
PE
2000
Springer
15 years 6 months ago
2000
Springer
In this paper we study the convergence properties of the power series algorithm, which is a general method to determine (functions of) stationary distributions of Markov chains. W...
176
click to vote
DAM
1999
15 years 6 months ago
1999
This paper deals with the problem of constructing Steiner trees of minimum weight with diameter bounded by d, spanning a given set of vertices in a graph. Exact solutions or logar...
186
click to vote
INFOCOM
2008
IEEE
16 years 1 months ago
2008
IEEE
—Rate allocation is a fundamental problem in the operation of a wireless network because of the necessity to schedule the operation of mutually interfering links between the node...
213
Voted
KDD
2010
ACM
15 years 10 months ago
2010
ACM
Constrained clustering has been well-studied for algorithms like K-means and hierarchical agglomerative clustering. However, how to encode constraints into spectral clustering rem...
185
click to vote
SODA
1998
ACM
15 years 8 months ago
1998
ACM
Given an undirected graph with nonnegative costs on the edges, the routing cost of any of its spanning trees is the sum over all pairs of vertices of the cost of the path between t...