Home›Graph Algorithm›Time Complexity›Polynomial Time -- O(n^k)Browse ByPolynomial Time -- O(n^k)This dimension groups algorithms by their time complexity, how the time an algorithm takes grows with the size of its input. Wikipedia notes that an algorithm "terminates after a finite number of steps," and how many steps it needs is exactly what time complexity measures. Browsing by time complexity keeps algorithms of a similar efficiency grouped together.FactsPolynomial Time -- O(n^k)SourcesComments (0)Reader Challenges (0)FactsComparisonEra of EmergenceWell-attested1878 CE 1Polynomial Time -- O(n^k)Filter Results14 entriesCategoryAllGraph Cut and Partitioning Algorithms (1)Minimum Spanning Tree Algorithms (2)Network Flow and Matching Algorithms (6)Shortest Path Algorithms (4)Traveling Salesman Tour Algorithms (1)Design TechniqueAllApproximation Algorithms (2)Dynamic Programming (1)Greedy Method (1)Heuristics (2)Recursion (1)Invented ByAllAndrew V. Goldberg (1)Harold W. Kuhn (1)Jack Edmonds (2)John Hopcroft (1)L. R. Ford Jr. (1)Nicos Christofides (1)Richard M. Karp (2)Robert Tarjan (1)Yefim Dinitz (1)GroupAllGraph Cut and Partitioning Algorithms (1)Minimum Spanning Tree Algorithms (2)Network Flow and Matching Algorithms (6)Shortest Path Algorithms (4)Traveling Salesman Tour Algorithms (1)Credited ToAllHarold W. Kuhn (1)Jack Edmonds (2)John Hopcroft (1)L. R. Ford Jr. (1)Nicos Christofides (1)Richard E. Bellman (1)Richard M. Karp (1)Yefim Dinitz (1)ACM AreaAllAlgorithms and Complexity Theory (14)Show ResultsBrowseCompareSelect all 14Bellman-Ford AlgorithmPolynomial Time -- O(n^k)Blossom AlgorithmPolynomial Time -- O(n^k)Christofides AlgorithmPolynomial Time -- O(n^k)Dinic's AlgorithmPolynomial Time -- O(n^k)Edmonds' AlgorithmPolynomial Time -- O(n^k)Edmonds-Karp AlgorithmPolynomial Time -- O(n^k)Hopcroft-Karp AlgorithmPolynomial Time -- O(n^k)Hungarian AlgorithmPolynomial Time -- O(n^k)Johnson's AlgorithmPolynomial Time -- O(n^k)Kernighan-Lin algorithmPolynomial Time -- O(n^k)Push-Relabel AlgorithmPolynomial Time -- O(n^k)Reverse-Delete AlgorithmPolynomial Time -- O(n^k)Suurballe's AlgorithmPolynomial Time -- O(n^k)Yen's AlgorithmPolynomial Time -- O(n^k)Sources1. Wikipedia: Graph theorytier 2WikipediaGraph theory, History section, term-origin sentenceQuote, Graph theory, History section, term-origin sentenceThe term "graph" was introduced by James Joseph Sylvester in a paper published in 1878 in Nature, where he drew an analogy between "quantic invariants" and "co-variants" of algebra and molecular diagrams.View the SourceComments (0)No comments yet. Be the first to share a thought.Sign in to join the discussion.Reader Challenges (0)No disputes yet. Spotted an error or a better source? Open the first one.Sign in to dispute this or suggest a correction.