Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
COCOA
/
Paper
Isolation Branching: A Branch and Bound Algorithm for the k-Terminal Cut Problem.
Mark Velednitsky
,
Dorit S. Hochbaum
Venue
C
COCOA
Year
2018
Proceedings
COCOA
DBLP record
conf/cocoa/VelednitskyH18 ↗
Browse the full
COCOA paper archive
.