1221 search results - page 91 / 245 » Balanced graph partitioning |
MICS
2008
13 years 7 months ago
2008
We present an approach to studying the community structures of networks by using linear programming (LP). Starting with a network in terms of (a) a collection of nodes and (b) a co...
IWOCA
2009
Springer
14 years 3 months ago
2009
Springer
We discuss various questions around partitioning a split graph into connected parts. Our main result is a polynomial time algorithm that decides whether a given split graph is full...
COMBINATORICS
2007
13 years 9 months ago
2007
The idea of graph compositions, which was introduced by A. Knopfmacher and M. E. Mays, generalizes both ordinary compositions of positive integers and partitions of finite sets. ...
JCT
2006
13 years 9 months ago
2006
Nash-Williams' arboricity theorem states that a finite graph is the edge-disjoint union of at most k forests if no set of vertices induces more than k( - 1) edges. We prove a...
ICPADS
2005
IEEE
14 years 2 months ago
2005
IEEE
PageRank becomes the most well-known re-ranking technique of the search results. By its iterative computational nature, the computation takes much computing time and resource. Res...