30 search results - page 5 / 6 » Minimum Multiway Cuts in Trees |
CVPR
2008
IEEE
14 years 1 months ago
2008
IEEE
In this paper, we propose a novel graph based clustering approach with satisfactory clustering performance and low computational cost. It consists of two main steps: tree fitting...
APPINF
2003
13 years 8 months ago
2003
In direct interconnection networks, the collective communication operation one to all, which is usually referred to as broadcasting, can be generalized to allow one source node to...
STOC
2010
ACM
14 years 9 days ago
2010
ACM
The Steiner tree problem is one of the most fundamental ÆÈ-hard problems: given a weighted undirected graph and a subset of terminal nodes, find a minimum weight tree spanning ...
ICCAD
1999
IEEE
13 years 11 months ago
1999
IEEE
The minimum rectilinear Steiner tree (RST) problem is one of the fundamental problems in the field of electronic design automation. The problem is NP-hard, and much work has been ...
IWPEC
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. We introduce the graph parameter boolean-width, related to the number of different unions of neighborhoods across a cut of a graph. For many graph problems this number is...