Sciweavers

4009 search results - page 80 / 802
» Clustering on Complex Graphs
Sort
View
149
Voted
IPPS
2010
IEEE
15 years 1 months ago
A distributed diffusive heuristic for clustering a virtual P2P supercomputer
Abstract--For the management of a virtual P2P supercomputer one is interested in subgroups of processors that can communicate with each other efficiently. The task of finding these...
Joachim Gehweiler, Henning Meyerhenke
ISAAC
2009
Springer
169views Algorithms» more  ISAAC 2009»
15 years 10 months ago
The Complexity of Solving Stochastic Games on Graphs
We consider some well-known families of two-player zero-sum perfect-information stochastic games played on finite directed graphs. Generalizing and unifying results of Liggett and...
Daniel Andersson, Peter Bro Miltersen
COMBINATORICS
2004
74views more  COMBINATORICS 2004»
15 years 3 months ago
Enumerative Problems Inspired by Mayer's Theory of Cluster Integrals
The basic functional equations for connected and 2-connnected graphs can be traced back to the statistical physicists Mayer and Husimi. They play an essential role in establishing...
Pierre Leroux
204
Voted
ICDE
2006
IEEE
155views Database» more  ICDE 2006»
16 years 5 months ago
Mining, Indexing, and Similarity Search in Graphs and Complex Structures
Jiawei Han, Xifeng Yan, Philip S. Yu
87
Voted
STACS
2010
Springer
15 years 10 months ago
Holant Problems for Regular Graphs with Complex Edge Functions
Michael Kowalczyk, Jin-yi Cai