Search Sciweavers | Sciweavers

1133 search results - page 59 / 227

» Basics of Graph Cuts

click to vote

STOC
1996
ACM

115views Algorithms» more STOC 1996»

Minimum Cuts in Near-Linear Time

14 years 2 months ago

Download www.cs.ust.hk

We significantly improve known time bounds for solving the minimum cut problem on undirected graphs. We use a "semiduality" between minimum cuts and maximum spanning tree...

David R. Karger

claim paper

Read More »

click to vote

IWPEC
2009
Springer

103views Applied Computing» more IWPEC 2009»

Paths of Bounded Length and Their Cuts: Parameterized Complexity and Algorithms

14 years 4 months ago

Download faculty.cs.tamu.edu

We study the parameterized complexity of two families of problems: the bounded length disjoint paths problem and the bounded length cut problem. From Menger’s theorem both proble...

Petr A. Golovach, Dimitrios M. Thilikos

claim paper

Read More »

click to vote

PR
2007

189views more PR 2007»

Information cut for clustering using a gradient descent approach

13 years 9 months ago

Download www.phys.uit.no

We introduce a new graph cut for clustering which we call the Information Cut. It is derived using Parzen windowing to estimate an information theoretic distance measure between p...

Robert Jenssen, Deniz Erdogmus, Kenneth E. Hild II...

claim paper

Read More »

click to vote

CMA
2010

73views more CMA 2010»

On the chromatic number of integral circulant graphs

13 years 7 months ago

Download www.dms.org.rs

Aleksandar Ilic, Milan Basic

claim paper

Read More »