scholarly journals Efficient Algorithms for String-Based Negative Selection

2009 ◽  
pp. 109-121 ◽  
Author(s):  
Michael Elberfeld ◽  
Johannes Textor
Keyword(s):  
Negative Selection ◽  
Efficient Algorithms

Tidal Flow: A Fast and Teachable Maximum Flow Algorithm

2018 ◽  
Vol 12 ◽  
pp. 25-41
Author(s):  
Matthew C. FONTAINE
Keyword(s):  
Computer Science ◽  
Tidal Flow ◽  
Maximum Flow ◽  
Efficient Algorithms ◽  
Science Students ◽  
Flow Algorithm ◽  
Maximum Flows

Among the most interesting problems in competitive programming involve maximum flows. However, efficient algorithms for solving these problems are often difficult for students to understand at an intuitive level. One reason for this difficulty may be a lack of suitable metaphors relating these algorithms to concepts that the students already understand. This paper introduces a novel maximum flow algorithm, Tidal Flow, that is designed to be intuitive to undergraduate andpre-university computer science students.

Efficient Algorithms for the Partial Sum Dispersion Problem

2020 ◽  
Vol E103.A (10) ◽  
pp. 1206-1210
Author(s):  
Toshihiro AKAGI ◽  
Tetsuya ARAKI ◽  
Shin-ichi NAKANO
Keyword(s):  
Efficient Algorithms ◽  
Partial Sum ◽  
Dispersion Problem
Sign in / Sign up

Export Citation Format

Share Document