Efficient Algorithms for the Closest String and Distinguishing String Selection Problems

Author(s):  
Lusheng Wang ◽  
Binhai Zhu
2018 ◽  
Vol 12 ◽  
pp. 25-41
Author(s):  
Matthew C. FONTAINE

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.


2014 ◽  
Vol 36 (5) ◽  
pp. 1047-1064 ◽  
Author(s):  
Bin LIAO ◽  
Jiong YU ◽  
Tao ZHANG ◽  
Xing-Yao YANG

2012 ◽  
Vol 35 (3) ◽  
pp. 603-615 ◽  
Author(s):  
Fa ZHANG ◽  
Antonio Fernandez Anta ◽  
Lin WANG ◽  
Chen-Ying HOU ◽  
Zhi-Yong LIU

Sign in / Sign up

Export Citation Format

Share Document