Minimum range balanced cuts via dynamic subset sumsEPPSTEIN, D.Journal of algorithms (Print). 1997, Vol 23, Num 2, pp 375-385, issn 0196-6774Article

Problème de flot maximal dans les réseaux avec retransmissionKUZ'MIN, S. L.Izvestiâ Akademii nauk SSSR. Tehničeskaâ kibernetika. 1984, Num 3, pp 133-135, issn 0002-3388Article

Approximating the minimum k-way cut in a graph via minimum 3-way cutsLIANG ZHAO; NAGAMOCHI, Hiroshi; IBARAKI, Toshihide et al.Journal of combinatorial optimization. 2001, Vol 5, Num 4, pp 397-410, issn 1382-6905Article

On the number of small cuts in a graphHENZINGER, M; WILLIAMSON, D. P.Information processing letters. 1996, Vol 59, Num 1, pp 41-44, issn 0020-0190Article

A contraction algorithm for finding small cycle cutsetsLEVY, H; LOW, D. W.Journal of algorithms (Print). 1988, Vol 9, Num 4, pp 470-493, issn 0196-6774Article

The latest research progress on spectral clusteringHONGJIE JIA; SHIFEI DING; XINZHENG XU et al.Neural computing & applications (Print). 2014, Vol 24, Num 7-8, pp 1477-1486, issn 0941-0643, 10 p.Article

3D shape recursive decomposition by Poisson equationXIANG PAN; QI HUA CHEN; ZHI LIU et al.Pattern recognition letters. 2009, Vol 30, Num 1, pp 11-17, issn 0167-8655, 7 p.Article

Polynomiality of sparsest cuts with fixed number of sourcesHONG, Sung-Pil; CHOI, Byung-Cheon.Operations research letters. 2007, Vol 35, Num 6, pp 739-742, issn 0167-6377, 4 p.Article

A polynomial time algorithm for the cutwidth of bounded degree graphs with small treewidthTHILIKOS, Dimitrios M; SERNA, Maria J; BODLAENDER, Hans L et al.Lecture notes in computer science. 2001, pp 380-390, issn 0302-9743, isbn 3-540-42493-8Conference Paper

One-third-integrality in the max-cut problemLAURENT, M; POLJAK, S.Mathematical programming. 1995, Vol 71, Num 1, pp 29-50, issn 0025-5610Article

Efficient algorithms for minimum range cut problemsKATOH, N; IWANO, K.Networks (New York, NY). 1994, Vol 24, Num 7, pp 395-407, issn 0028-3045Article

The density of a maximum minimal cut in the subset lattice of a finite set is almost oneFENG SHI; WEIXUAN LI.Discrete mathematics. 1993, Vol 123, Num 1-3, pp 111-115, issn 0012-365XArticle

Algorithms for the minimum cost circulation problem based on maximizing the mean improvementHASSIN, R.Operations research letters. 1992, Vol 12, Num 4, pp 227-233, issn 0167-6377Article

Tight integral duality gap in the Chinese Postman problemKORACH, E; PENN, M.Mathematical programming. 1992, Vol 55, Num 2, pp 183-191, issn 0025-5610Article

Cutting a graph into two dissimilar halvesERDOS, P; GOLDBERG, M; PACH, J et al.Journal of graph theory. 1988, Vol 12, Num 1, pp 121-131, issn 0364-9024Article

New algorithms for fault trees analysisRAUZY, A.Reliability engineering & systems safety. 1993, Vol 40, Num 3, pp 203-211, issn 0951-8320Article

On 3-connected graphs with contractible edge covers of size kHEMMINGER, R. L; XINGXING YU.Discrete mathematics. 1992, Vol 101, Num 1-3, pp 115-133, issn 0012-365XArticle

An improved algorithm for the planar 3-cut problemXIN HE.Journal of algorithms (Print). 1991, Vol 12, Num 1, pp 23-37, issn 0196-6774Article

Cones of alternating and cut submodular set functionsGRISHUHIN, V. P.Combinatorica (Print). 1989, Vol 9, Num 1, pp 21-32, issn 0209-9683Article

A linear algorithm for the cutting center of a treeHARARY, F; SLATER, P. J.Information processing letters. 1986, Vol 23, Num 6, pp 317-319, issn 0020-0190Article

Coupure des graphes et programmation quadratique (0,1)MATITSKAS, J.-K. L; PALUBETSKIS, G. S.Izvestiâ Akademii nauk SSSR. Tehničeskaâ kibernetika. 1986, Num 4, pp 152-159, issn 0002-3388Article

An exact lower bound on the number of cut-sets in multigraphsHARADA, H; ZHENG SUN; NAGAMOCHI, H et al.Networks (New York, NY). 1994, Vol 24, Num 8, pp 429-443, issn 0028-3045Article

Reliability evaluation of a limited-flow network in terms of minimal cutsetsCHIN-CHIA JANE; JSEN-SCHUNG LIN; JOHN YUAN et al.IEEE transactions on reliability. 1993, Vol 42, Num 3, pp 354-361, issn 0018-9529, 368 [9 p.]Article

The equivalent subgraph and directed cut polyhedra on series-parallel graphsSUNIL CHOPRA.SIAM journal on discrete mathematics (Print). 1992, Vol 5, Num 4, pp 475-490, issn 0895-4801Article

The arc partitioning problemBODIN, L; LEVY, L.European journal of operational research. 1991, Vol 53, Num 3, pp 393-401, issn 0377-2217Article