Product
Help
Pricing
About
Jobs
Log in
Get started
Keyword
Add to collection
cubic time algorithm
Description:
An algorithm with running time proportional to the cube of input size, commonly analyzed in computational complexity and graph algorithms.
Related topics:
Complexity and Algorithms in Graphs (15%),
Advanced Graph Theory Research (14%),
Genomics and Phylogenetic Studies (10%),
Logic, programming, and type systems (7%)
OpenAlex ID:
keywords/cubic-time-algorithm
Recognition and parsing of context-free languages in time n3
1967
·
Daniel H. Younger
·
Information and Control
·
1,139
Graph pattern matching: from intractable to polynomial time
2010
·
Wenfei Fan
, Jianzhong Li
, et al.
·
Proceedings of the VLDB Endowment
·
337
PDF
A more effective linear kernelization for cluster editing
2008
·
Jiong Guo
·
Theoretical Computer Science
·
194
PDF
Weak bisimulation for fully probabilistic processes
1997
·
Christel Baier
, Holger Hermanns
·
Lecture notes in computer science
·
177
PDF
Adding regular expressions to graph reachability and pattern queries
2011
·
Wenfei Fan
, Jianzhong Li
, et al.
·
IEEE International Conference on Data Engineering (ICDE)
·
163
Capturing topology in graph pattern matching
2011
·
Shuai Ma
, Yang Cao
, et al.
·
Proceedings of the VLDB Endowment
·
130
PDF
Strong simulation: Capturing topology in graph pattern matching
2014
·
Shuai Ma
, Yang Cao
, et al.
·
ACM Transactions on Database Systems
·
129
Finding paths and deleting edges in directed acyclic graphs
1988
·
Giuseppe F. Italiano
·
Information Processing Letters
·
114
n-Fold integer programming in cubic time
2011
·
Raymond Hemmecke
, Shmuel Onn
, et al.
·
Mathematical Programming
·
110
PDF
Improved algorithm for all pairs shortest paths
2004
·
Yijie Han
·
Information Processing Letters
·
68
RNA Accessibility in cubic time
2011
·
Stephan H Bernhart
, Ullrike Mückstein
, et al.
·
Algorithms for Molecular Biology
·
64
PDF
Subgraph isomorphism for biconnected outerplanar graphs in cubic time
1989
·
Andrzej Lingas
·
Theoretical Computer Science
·
62
PDF
Parsing of General Context-Free Languages
1976
·
Susan L. Graham
, Michael A. Harrison
·
Advances in computers
·
50
A Rule for Committee Selection with Soft Diversity Constraints
2019
·
Haris Aziz
·
Group Decision and Negotiation
·
39
PDF
Recognizing Hole-Free 4-Map Graphs in Cubic Time
2006
·
Zhi-Zhong Chen
, Michelangelo Grigni
, et al.
·
Algorithmica
·
39
A Cubic Algorithm for Computing Gaussian Volume
2013
·
Ben Cousins
, Santosh Vempala
·
ACM-SIAM Symposium on Discrete Algorithms (SODA)
·
38
Diophantine linear system solving
1999
·
Thom Mulders
, Arne Storjohann
·
International Symposium on Symbolic and Algebraic Computation
·
37
PDF
Best match graphs
2019
·
Manuela Geiß
, Edgar Chávez
, et al.
·
Journal of Mathematical Biology
·
36
PDF
Complexity of the path avoiding forbidden pairs problem revisited
2013
·
Jakub Kováč
·
Discrete Applied Mathematics
·
34
PDF
Constraint Abstractions
2001
·
Jörgen Gustavsson
, Josef Svenningsson
·
Lecture notes in computer science
·
34
Hairpin Completion Versus Hairpin Reduction
2007
·
Florin Manea
, Victor Mitrana
·
Lecture notes in computer science
·
33
Polyline Simplification has Cubic Complexity
2018
·
Bringmann, Karl
, Chaudhury, Bhaskar Ray
·
Journal of computational geometry
·
32
PDF
Reconfiguring Independent Sets in Cographs
2014
·
Bonamy, Marthe
, Bousquet, Nicolas
·
arXiv (Cornell University)
·
28
PDF
A More Effective Linear Kernelization for Cluster Editing
2007
·
Jiong Guo
·
Lecture notes in computer science
·
27
Reconciliation of Gene and Species Trees
2014
·
L. Y. Rusin
, E. V. Lyubetskaya
, et al.
·
BioMed Research International
·
26
PDF
Show more works
View as search
Works count:
150
Citation count:
3,845
Year
Topic
Type