1729 search results - page 329 / 346 » On Bounds for the k-Partitioning of Graphs |
IPPS
2005
IEEE
15 years 3 months ago
2005
IEEE
Commodity computer clusters are often composed of hundreds of computing nodes. These generally off-the-shelf systems are not designed for high reliability. Node failures therefore...
PODC
2005
ACM
15 years 3 months ago
2005
ACM
We study the distributed complexity of computing a maximal independent set (MIS) in radio networks with completely unknown topology, asynchronous wake-up, and no collision detecti...
106
click to vote
WAOA
2005
Springer
15 years 3 months ago
2005
Springer
Given a graph with a source and a sink node, the NP–hard maximum k–splittable flow (MkSF) problem is to find a flow of maximum value with a flow decomposition using at most...
COMPGEOM
2004
ACM
15 years 3 months ago
2004
ACM
Triangle strips have been widely used for efficient rendering. It is NP-complete to test whether a given triangulated model can be represented as a single triangle strip, so many...
111
click to vote
WAW
2004
Springer
15 years 3 months ago
2004
Springer
We develop an algorithm to detect community structure in complex networks. The algorithm is based on spectral methods and takes into account weights and links orientations. Since t...