Home›Graph Algorithm›Design TechniqueBrowse ByDesign TechniqueThis dimension groups algorithms by the design technique they use, divide and conquer, dynamic programming or greedy choice. Wikipedia notes that "advanced algorithms may utilize loops and involve many conditionals that decide the next step based on the inputs provided," a structural choice that defines the technique behind the algorithm. Browsing by design technique keeps algorithms built the same way grouped together.FactsDesign TechniqueSourcesComments (0)Reader Challenges (0)FactsComparisonEra of EmergenceWell-attested1878 CE 1Design TechniqueFilter Results7 entriesCategoryAllCommunity Detection and Link Analysis Algorithms (2)Graph Algorithms (1)Graph Cut and Partitioning Algorithms (3)Graph Traversal and Connectivity Algorithms (2)Maze and Network Generation Algorithms (1)Minimum Spanning Tree Algorithms (2)Network Flow and Matching Algorithms (1)Phylogenetic Tree Algorithms and Measures (3)Planar Graph Algorithms (1)Shortest Path Algorithms (1)Traveling Salesman Tour Algorithms (3)Time ComplexityAllCubic Time -- O(n^3) (5)Exponential Time -- O(2^n) (2)Linear Time -- O(n) (3)Linearithmic Time -- O(n log n) (1)Polynomial Time -- O(n^k) (5)Quadratic Time -- O(n^2) (1)Invented ByAllDavid Karger (1)Edsger W. Dijkstra (1)Jack Edmonds (1)Jon Kleinberg (1)Joseph Kruskal (1)L. R. Ford Jr. (1)Larry Page (1)Micha Sharir (1)Nicos Christofides (2)Otakar Borůvka (1)Richard M. Karp (1)Robert Tarjan (1)Robert W. Floyd (1)GroupAllCommunity Detection and Link Analysis Algorithms (2)Graph Algorithms (1)Graph Cut and Partitioning Algorithms (3)Graph Traversal and Connectivity Algorithms (2)Maze and Network Generation Algorithms (1)Minimum Spanning Tree Algorithms (2)Network Flow and Matching Algorithms (1)Phylogenetic Tree Algorithms and Measures (3)Planar Graph Algorithms (1)Shortest Path Algorithms (1)Traveling Salesman Tour Algorithms (3)Credited ToAllDavid Karger (1)Edsger W. Dijkstra (1)Jack Edmonds (1)Jon Kleinberg (1)Joseph Kruskal (1)L. R. Ford Jr. (1)Larry Page (1)Micha Sharir (1)Nicos Christofides (2)Otakar Borůvka (1)Richard E. Bellman (1)Richard M. Karp (1)Robert Tarjan (1)Robert W. Floyd (1)ACM AreaAllAlgorithms and Complexity Theory (7)Bioinformatics (3)Information Retrieval (1)Origin YearAll1952 (1)1960 (1)Show ResultsBrowseCompareApproximation AlgorithmsDesign Technique6 entriesBacktrackingDesign Technique3 entriesDynamic ProgrammingDesign Technique5 entriesGreedy MethodDesign Technique10 entriesHeuristicsDesign Technique6 entriesRandomized AlgorithmsDesign Technique1 entryRecursionDesign Technique7 entriesSources1. 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.