135 search results - page 1 / 27 » Hardness of cut problems in directed graphs |
STOC
2006
ACM
14 years 5 months ago
2006
ACM
STOC
2007
ACM
14 years 5 months ago
2007
ACM
TAMC
2009
Springer
13 years 11 months ago
2009
Springer
We investigate a natural combinatorial optimization problem called the Label Cut problem. Given an input graph G with a source s and a sink t, the edges of G are classified into ...
SDM
2007
SIAM
13 years 6 months ago
2007
SIAM
In this paper we formulate spectral clustering in directed graphs as an optimization problem, the objective being a weighted cut in the directed graph. This objective extends seve...
DAM
2007
13 years 4 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...