352 search results - page 37 / 71 » Partitioning Graphs into Connected Parts |
118
click to vote
JCT
2008
15 years 4 months ago
2008
A 4-graph is odd if its vertex set can be partitioned into two sets so that every edge intersects both parts in an odd number of points. Let b(n) = max n 3 + (n - ) 3 = 1 2 + o...
136
click to vote
COCOON
2003
Springer
15 years 9 months ago
2003
Springer
The relationship between graph coloring and the immersion order is considered. Vertex connectivity, edge connectivity and related issues are explored. These lead to the conjecture...
135
click to vote
KDD
2007
ACM
16 years 4 months ago
2007
ACM
Network clustering (or graph partitioning) is an important task for the discovery of underlying structures in networks. Many algorithms find clusters by maximizing the number of i...
164
click to vote
IPPS
1999
IEEE
15 years 8 months ago
1999
IEEE
We investigate the average-case speed and scalability of parallel algorithms executing on multiprocessors. Our performance metrics are average-speed and isospeed scalability. By m...
133
click to vote
FOCS
2009
IEEE
15 years 10 months ago
2009
IEEE
In this paper, we set forth a new algorithm for generating approximately uniformly random spanning trees in undirected graphs. We show how to sample from a distribution that is wi...