Product
Help
Pricing
About
Jobs
Log in
Get started
Keyword
Add to collection
quadratic-time algorithm
Description:
A quadratic-time algorithm is an algorithm whose running time grows proportionally to the square of the input size.
Related topics:
Advanced Graph Theory Research (16%),
Algorithms and Data Compression (13%),
Complexity and Algorithms in Graphs (11%),
Computational Geometry and Mesh Generation (7%)
OpenAlex ID:
keywords/quadratic-time-algorithm
A linear space algorithm for computing maximal common subsequences
1975
·
D. S. Hirschberg
·
Communications of the ACM
·
1,259
PDF
Computing an Exact Confidence Interval for the Common Odds Ratio in Several 2 × 2 Contingency Tables
1985
·
Cyrus R. Mehta
, Nitin R. Patel
, et al.
·
Journal of the American Statistical Association
·
431
The disjoint paths problem in quadratic time
2011
·
Ken-ichi Kawarabayashi
, Yusuke Kobayashi
, et al.
·
Journal of Combinatorial Theory Series B
·
292
PDF
The power of geometric duality
1985
·
Bernard Chazelle
, Leo J. Guibas
, et al.
·
BIT Numerical Mathematics
·
292
“Simplest” Paths: Automated Route Selection for Navigation
2003
·
Matt Duckham
, Lars Kulik
·
Lecture notes in computer science
·
262
Bounds on the Complexity of the Longest Common Subsequence Problem
1976
·
J. D. Ullman
, A. V. Aho
, et al.
·
Journal of the ACM
·
255
The Move-Split-Merge Metric for Time Series
2012
·
Alexandra Stefan
, Vassilis Athitsos
, et al.
·
IEEE Transactions on Knowledge and Data Engineering
·
234
A bound on the chromatic number of the square of a planar graph
2005
·
Michael Molloy
, Mohammad R. Salavatipour
·
Journal of Combinatorial Theory Series B
·
204
PDF
A Faster and Simpler Algorithm for Sorting Signed Permutations by Reversals
2000
·
Haim Kaplan
, Ron Shamir
, et al.
·
SIAM Journal on Computing
·
190
Adding regular expressions to graph reachability and pattern queries
2011
·
Wenfei Fan
, Jianzhong Li
, et al.
·
IEEE International Conference on Data Engineering (ICDE)
·
163
De Bruijn Graph s and Linear Cellular Automata
1991
·
Klaus Sutner
·
Complex Systems
·
145
Analysis of an exact algorithm for the vessel speed optimization problem
2013
·
Lars Magnus Hvattum
, Inge Norstad
, et al.
·
Networks
·
118
Obtaining a Planar Graph by Vertex Deletion
2011
·
Dániel Marx
, Ildikó Schlotter
·
Algorithmica
·
101
PDF
An efficient algorithm for the minimal unsatisfiability problem for a subclass of CNF
1998
·
Gennady Davydov
, Inna Davydova
, et al.
·
Annals of Mathematics and Artificial Intelligence
·
100
The Minimum k-way Cut of Bounded Size is Fixed-Parameter Tractable
2011
·
Ken-ichi Kawarabayashi
, Mikkel Thorup
·
Annual Symposium on Foundations of Computer Science
·
98
Improved Bounds on the Planar Branchwidth with Respect to the Largest Grid Minor Size
2012
·
Qian-Ping Gu
, Hisao Tamaki
·
Algorithmica
·
97
PDF
Using instance-level constraints in agglomerative hierarchical clustering: theoretical and empirical results
2008
·
Ian Davidson
, S. S. Ravi
·
Data Mining and Knowledge Discovery
·
97
Computing crossing numbers in quadratic time
2003
·
Martin Grohe
·
Journal of Computer and System Sciences
·
95
PDF
A speed and departure time optimization algorithm for the pollution-routing problem
2015
·
Raphael Kramer
, Nelson Maculan
, et al.
·
European Journal of Operational Research
·
94
PDF
Computing crossing numbers in quadratic time
2001
·
Martin Grohe
·
ACM Symposium on Theory of Computing (STOC)
·
91
Models and algorithms for coscheduling compute-intensive taks on a network of workstations
1992
·
Mikhail J. Atallah
, Christina Lock Black
, et al.
·
Journal of Parallel and Distributed Computing
·
89
PDF
Tiling a polygon with rectangles
1992
·
C. Kenyon
, R. Kenyon
·
Annual Symposium on Foundations of Computer Science
·
88
Ordering the braid groups
1999
·
R. Fenn
, M.T. Greene
, et al.
·
Pacific Journal of Mathematics
·
84
PDF
Topologically Correct Subdivision Simplification Using the Bandwidth Criterion
1998
·
Mark de Berg
, Marc van Kreveld
, et al.
·
Cartography and Geographic Information Systems
·
84
The power of geometric duality
1983
·
Bernard Chazelle
, Leo J. Guibas
, et al.
·
Annual Symposium on Foundations of Computer Science
·
84
Show more works
View as search
Works count:
581
Citation count:
9,282
Year
Topic
Type