185 search results - page 10 / 37 » A Simple Min Cut Algorithm |
143
Voted
STACS
1994
Springer
15 years 5 months ago
1994
Springer
The complexity of the simple maxcut problem is investigated for several special classes of graphs. It is shown that this problem is NP-complete when restricted to one of the follo...
96
Voted
EVOW
2006
Springer
15 years 4 months ago
2006
Springer
The k-cut problem is an NP-complete problem which consists of finding a partition of a graph into k balanced parts such that the number of cut edges is minimized. Different algori...
102
Voted
RTA
2005
Springer
15 years 6 months ago
2005
Springer
We present constructive arithmetic in Deduction modulo with rewrite rules only. In natural deduction and in sequent calculus, the cut elimination theorem and the analysis of the st...
169
Voted
APBC
2004
15 years 2 months ago
2004
Pseudoknots are widely occurring structural motifs in RNA. Pseudoknots have been shown to be functionally important in different RNAs which play regulatory, catalytic, or structur...
103
Voted
ESA
2000
Springer
15 years 4 months ago
2000
Springer
We show that a popular variant of the well known k-d tree data structure satisfies an important packing lemma. This variant is a binary spatial partitioning tree T defined on a set...