Space-Efficient Algorithms for Maximum Cardinality Search, Stack BFS, Queue BFS and Applications

2017 ◽  
pp. 87-98 ◽  
Author(s):  
Sankardeep Chakraborty ◽  
Srinivasa Rao Satti
Keyword(s):  
Efficient Algorithms ◽  
Maximum Cardinality

Space-efficient algorithms for maximum cardinality search, its applications, and variants of BFS

2018 ◽  
Vol 37 (2) ◽  
pp. 465-481 ◽  
Author(s):  
Sankardeep Chakraborty ◽  
Srinivasa Rao Satti
Keyword(s):  
Efficient Algorithms ◽  
Maximum Cardinality

ALGORITHMS FOR POINT SET MATCHING WITH k-DIFFERENCES

2006 ◽  
Vol 17 (04) ◽  
pp. 903-917
Author(s):  
TATSUYA AKUTSU
Keyword(s):  
Euclidean Space ◽  
Related Problem ◽  
Time Algorithm ◽  
Two Dimensions ◽  
Efficient Algorithms ◽  
Common Point ◽  
Dimensional Euclidean Space ◽  
Maximum Cardinality ◽  
Point Set ◽  
Special Case

The largest common point set problem (LCP) is, given two point set P and Q in d-dimensional Euclidean space, to find a subset of P with the maximum cardinality that is congruent to some subset of Q. We consider a special case of LCP in which the size of the largest common point set is at least (|P| + |Q| - k)/2. We develop efficient algorithms for this special case of LCP and a related problem. In particular, we present an O(k3n1.34 + kn2 log n) time algorithm for LCP in two-dimensions, which is much better for small k than an existing O(n3.2 log n) time algorithm, where n = max {|P|,|Q|}.

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

Energy-Efficient Algorithms for Distributed File System HDFS

2014 ◽  
Vol 36 (5) ◽  
pp. 1047-1064 ◽  
Author(s):  
Bin LIAO ◽  
Jiong YU ◽  
Tao ZHANG ◽  
Xing-Yao YANG
Keyword(s):  
Energy Efficient ◽  
File System ◽  
Efficient Algorithms ◽  
Distributed File System

Network Energy Consumption Models and Energy Efficient Algorithms

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

Development of Efficient Algorithms for Predicting Aircraft's Braking Mode

2020 ◽  
Vol 81 (10) ◽  
pp. 1884-1895
Author(s):  
A. M. Shevchenko ◽  
G. N. Nachinkina ◽  
M. V. Gorodnova
Keyword(s):  
Efficient Algorithms
Sign in / Sign up

Export Citation Format

Share Document