1221 search results - page 25 / 245 » Balanced graph partitioning |
FOCS
2009
IEEE
14 years 3 months ago
2009
IEEE
—We introduce a new tool for approximation and testing algorithms called partitioning oracles. We develop methods for constructing them for any class of bounded-degree graphs wit...
IAT
2006
IEEE
14 years 2 months ago
2006
IEEE
Unstructured P2P networks can grow in an ad-hoc and give rise to scale-free graphs where most of the nodes form clusters or hubs around few resourceful nodes. This leads to conges...
ISCAPDCS
2003
13 years 10 months ago
2003
In this paper, we present a system partitioning technique in which the input system specification is based on C++ language. The proposed technique processes data and precedence de...
DAM
2007
13 years 8 months ago
2007
: In this paper we deal with the arc ranking problem of directed graphs. We give some classes of graphs for which the arc ranking problem is polynomially solvable. We prove that de...
EJC
2008
13 years 7 months ago
2008
Let be a G-symmetric graph, and let B be a nontrivial G-invariant partition of the vertex set of . This paper aims to characterize (, G) under the conditions that the quotient gr...