Product
Help
Pricing
About
Jobs
Log in
Get started
Keyword
Add to collection
reverse search
Description:
An algorithmic technique for enumerating combinatorial objects by traversing a search tree whose structure permits efficient generation without storing all previously visited objects.
Related topics:
Complexity and Algorithms in Graphs (11%),
Computational Geometry and Mesh Generation (10%),
Advanced Combinatorial Mathematics (8%),
Advanced Graph Theory Research (7%)
OpenAlex ID:
keywords/reverse-search
DIANA-miRPath v3.0: deciphering microRNA function with experimental support
2015
·
Ioannis S. Vlachos
, Konstantinos Zagganas
, et al.
·
Nucleic Acids Research
·
1,820
Reverse search for enumeration
1996
·
David Avis
, Komei Fukuda
·
Discrete Applied Mathematics
·
899
DIANA miRPath v.2.0: investigating the combinatorial effect of microRNAs in pathways
2012
·
Ioannis S. Vlachos
, Nikos Kostoulas
, et al.
·
Nucleic Acids Research
·
582
PDF
A note on finding the bridges of a graph
1974
·
R.Endre Tarjan
·
Information Processing Letters
·
288
Polytopes — Combinatorics and Computation
2000
·
Ziegler, Günther M
, Kalai, Gil
·
Birkhäuser Basel eBooks
·
217
From the zonotope construction to the Minkowski addition of convex polytopes
2004
·
Komei Fukuda
·
Journal of Symbolic Computation
·
197
PDF
Exhaustive Search, Combinatorial Optimization and Enumeration: Exploring the Potential of Raw Computing Power
2000
·
Jürg Nievergelt
·
Lecture notes in computer science
·
120
An Efficient Algorithm for Solving Pseudo Clique Enumeration Problem
2008
·
Takeaki Uno
·
Algorithmica
·
107
Enumeration of condition-dependent dense modules in protein interaction networks
2009
·
Elisabeth Georgii
, Sabine Dietmann
, et al.
·
Bioinformatics
·
99
PDF
Solving the fixed rank convex quadratic maximization in binary variables by a parallel zonotope construction algorithm
2004
·
J.-A. Ferrez
, K. Fukuda
, et al.
·
European Journal of Operational Research
·
85
Automated identification of mass spectra by the reverse search
1975
·
Fred P. Abramson
·
Analytical Chemistry
·
85
Path planning for a UAV with kinematic constraints in the presence of polygonal obstacles
2016
·
Parikshit Maini
, P. B. Sujit
·
International Conference on Unmanned Aircraft Systems (ICUAS)
·
81
Computing Gröbner fans
2007
·
Komei Fukuda
, Anders Jensen
, et al.
·
Mathematics of Computation
·
55
PDF
Generating Rooted Triangulations Without Repetitions
1996
·
D. Avis
·
Algorithmica
·
48
All maximal independent sets and dynamic dominance for sparse graphs
2009
·
David Eppstein
·
ACM Transactions on Algorithms
·
47
PDF
An Efficient Algorithm for Enumerating Pseudo Cliques
2007
·
Takeaki Uno
·
Springer eBooks
·
45
Efficient Algorithms for Maximal k-Biplex Enumeration
2022
·
Kaiqiang Yu
, Cheng Long
, et al.
·
ACM SIGMOD International Conference on Management of Data (SIGMOD)
·
42
PDF
mplrs: A scalable parallel vertex/facet enumeration code
2017
·
David Avis
, Charles Jordan
·
Mathematical Programming Computation
·
42
PDF
A New Algorithm for Enumeration of Cells of Hyperplane Arrangements and a Comparison with Avis and Fukuda's Reverse Search
2018
·
Miroslav Rada
, Michal Černý
·
SIAM Journal on Discrete Mathematics
·
39
Output-sensitive cell enumeration in hyperplane arrangements
1998
·
Nora Sleumer
·
Lecture notes in computer science
·
39
Enumeration of Polyhex Hydrocarbons to h = 21
1998
·
Gilles Caporossi
, Pierre Hansen
·
Journal of Chemical Information and Computer Sciences
·
37
New polynomial delay bounds for maximal subgraph enumeration by proximity search
2019
·
Alessio Conte
, Takeaki Uno
·
ACM Symposium on Theory of Computing (STOC)
·
36
Computing Gröbner Fans of Toric Ideals
2000
·
Birkett Huber
, Rekha R. Thomas
·
Experimental Mathematics
·
35
Maximal Defective Clique Enumeration
2023
·
Qiangqiang Dai
, Rong-Hua Li
, et al.
·
Proceedings of the ACM on Management of Data
·
33
PDF
Transforming L1000 profiles to RNA-seq-like profiles with deep learning
2022
·
Minji Jeon
, Zhuorui Xie
, et al.
·
BMC Bioinformatics
·
33
PDF
Show more works
View as search
Works count:
235
Citation count:
5,951
Year
Topic
Type