Sciweavers

1221 search results - page 17 / 245
» Balanced graph partitioning
Sort
View
GD
2006
Springer
13 years 11 months ago
Partitions of Graphs into Trees
In this paper, we study the k-tree partition problem which is a partition of the set of edges of a graph into k edge-disjoint trees. This problem occurs at several places with appl...
Therese C. Biedl, Franz-Josef Brandenburg
ADC
2008
Springer
110views Database» more  ADC 2008»
14 years 1 months ago
Graph Mining based on a Data Partitioning Approach
Existing graph mining algorithms typically assume that the dataset can fit into main memory. As many large graph datasets cannot satisfy this condition, truly scalable graph minin...
Son N. Nguyen, Maria E. Orlowska, Xue Li
PPSC
1997
13 years 9 months ago
Dynamic Load-Balancing for Parallel Adaptive Unstructured Meshes
A parallel method for dynamic partitioning of unstructured meshes is described. The method employs a new iterative optimisation technique which both balances the workload and atte...
Chris Walshaw, Mark Cross, M. G. Everett
CORR
2010
Springer
135views Education» more  CORR 2010»
13 years 7 months ago
Balanced distribution-energy inequalities and related entropy bounds
Let A be a self-adjoint operator acting over a space X endowed with a partition. We give lower bounds on the energy of a mixed state from its distribution in the partition and the...
Michel Rumin
BIBE
2005
IEEE
154views Bioinformatics» more  BIBE 2005»
14 years 1 months ago
Effective Pre-Processing Strategies for Functional Clustering of a Protein-Protein Interactions Network
In this article we present novel preprocessing techniques, based on topological measures of the network, to identify clusters of proteins from Protein-protein interaction (PPI) ne...
Duygu Ucar, Srinivasan Parthasarathy, Sitaram Asur...