Home›Graph Algorithm›GroupBrowse ByGroupThis page names the family of related algorithms that a specific algorithm belongs to. Wikipedia notes that an algorithm produces "a solution to a given computational problem," and many algorithms solving the same problem form a recognized family or group. Browsing this way moves between an algorithm and its close relatives.FactsGroupSourcesComments (0)Reader Challenges (0)FactsComparisonEra of EmergenceWell-attested1878 CE 1GroupFilter Results12 entriesCategoryAllCommunity Detection and Link Analysis Algorithms (1)Graph Algorithms (1)Graph Cut and Partitioning Algorithms (1)Graph Traversal and Connectivity Algorithms (1)Maze and Network Generation Algorithms (1)Minimum Spanning Tree Algorithms (1)Network Flow and Matching Algorithms (1)Phylogenetic Tree Algorithms and Measures (1)Planar Graph Algorithms (1)Rule Matching and Automata Conversion Algorithms (1)Shortest Path Algorithms (1)Traveling Salesman Tour Algorithms (1)Time ComplexityAllCubic Time -- O(n^3) (3)Exponential Time -- O(2^n) (2)Linear Time -- O(n) (1)Linearithmic Time -- O(n log n) (2)Polynomial Time -- O(n^k) (5)Quadratic Time -- O(n^2) (1)Design TechniqueAllApproximation Algorithms (3)Backtracking (2)Dynamic Programming (3)Greedy Method (3)Heuristics (3)Randomized Algorithms (1)Recursion (5)Invented ByAllAndrew V. Goldberg (1)David Karger (1)Edsger W. Dijkstra (1)Harold W. Kuhn (1)Jack Edmonds (2)John Hopcroft (1)Jon Kleinberg (1)Joseph Kruskal (1)Konrad Zuse (1)L. R. Ford Jr. (1)Larry Page (1)Micha Sharir (1)Michelle Girvan (1)Nicos Christofides (1)Otakar Borůvka (1)Richard M. Karp (2)Robert Tarjan (2)Robert W. Floyd (1)Yefim Dinitz (1)Credited ToAllDavid Karger (1)Edsger W. Dijkstra (1)Harold W. Kuhn (1)Jack Edmonds (2)John Hopcroft (1)Jon Kleinberg (1)Joseph Kruskal (1)Konrad Zuse (1)L. R. Ford Jr. (1)Larry Page (1)Micha Sharir (1)Michelle Girvan (1)Nicos Christofides (1)Otakar Borůvka (1)Richard E. Bellman (2)Richard M. Karp (2)Robert Tarjan (1)Robert W. Floyd (1)Yefim Dinitz (1)ACM AreaAllAlgorithms and Complexity Theory (11)Bioinformatics (1)Computer Vision (1)Information Retrieval (1)Machine Learning (1)Show ResultsCommunity Detection and Link Analysis AlgorithmsGroup7 entriesGraph AlgorithmsGroup1 entryGraph Cut and Partitioning AlgorithmsGroup3 entriesGraph Traversal and Connectivity AlgorithmsGroup9 entriesMaze and Network Generation AlgorithmsGroup2 entriesMinimum Spanning Tree AlgorithmsGroup5 entriesNetwork Flow and Matching AlgorithmsGroup9 entriesPhylogenetic Tree Algorithms and MeasuresGroup3 entriesPlanar Graph AlgorithmsGroup2 entriesRule Matching and Automata Conversion AlgorithmsGroup2 entriesShortest Path AlgorithmsGroup6 entriesTraveling Salesman Tour AlgorithmsGroup2 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.