1133 search results - page 61 / 227 » Basics of Graph Cuts |
STOC
2007
ACM
14 years 10 months ago
2007
ACM
Semidefinite programs (SDP) have been used in many recent approximation algorithms. We develop a general primal-dual approach to solve SDPs using a generalization of the well-know...
IPCO
2008
13 years 11 months ago
2008
Abstract. Determining the integrality gap of the bidirected cut relaxation for the metric Steiner tree problem, and exploiting it algorithmically, is a long-standing open problem. ...
ENTCS
2008
13 years 10 months ago
2008
Graphs are among the most frequently used structures in Computer Science. In this work, we analyze how we can express some important graph properties such as connectivity, acyclic...
IM
2007
13 years 10 months ago
2007
A local graph partitioning algorithm finds a cut near a specified starting vertex, with a running time that depends largely on the size of the small side of the cut, rather than...
KDD
2005
ACM
14 years 10 months ago
2005
ACM
Graph clustering (also called graph partitioning) -- clustering the nodes of a graph -- is an important problem in diverse data mining applications. Traditional approaches involve...