Home›Graph Algorithm›Credited ToBrowse ByCredited ToThis dimension names the person or team credited with an algorithm's own development. Wikipedia notes that computer science spans "theoretical disciplines (such as algorithms, theory of computation, and information theory)," whose named contributors are often the same people credited with a given algorithm. Browsing this way collects every algorithm credited to the same author.FactsCredited ToSourcesComments (0)Reader Challenges (0)FactsComparisonEra of EmergenceWell-attested1878 CE 1Credited ToFilter Results21 entriesCategoryAllCommunity Detection and Link Analysis Algorithms (3)Graph Cut and Partitioning Algorithms (1)Graph Traversal and Connectivity Algorithms (3)Minimum Spanning Tree Algorithms (4)Network Flow and Matching Algorithms (5)Shortest Path Algorithms (3)Traveling Salesman Tour Algorithms (3)Time ComplexityAllCubic Time -- O(n^3) (2)Exponential Time -- O(2^n) (2)Linear Time -- O(n) (4)Linearithmic Time -- O(n log n) (3)Polynomial Time -- O(n^k) (7)Design TechniqueAllApproximation Algorithms (1)Dynamic Programming (4)Greedy Method (3)Heuristics (1)Randomized Algorithms (1)Recursion (5)Invented ByAllDavid Karger (1)Edsger W. Dijkstra (2)Harold W. Kuhn (1)Jack Edmonds (1)John Hopcroft (1)Jon Kleinberg (1)Joseph Kruskal (2)K. Mani Chandy (1)Konrad Zuse (1)L. R. Ford Jr. (2)Larry Page (1)Micha Sharir (1)Michelle Girvan (1)Nicos Christofides (1)Otakar Borůvka (1)Radia Perlman (1)Richard M. Karp (3)Robert Tarjan (1)Robert W. Floyd (1)Yefim Dinitz (1)Invented By CompanyAllDigital Equipment Corporation (1)GroupAllCommunity Detection and Link Analysis Algorithms (3)Graph Cut and Partitioning Algorithms (1)Graph Traversal and Connectivity Algorithms (3)Minimum Spanning Tree Algorithms (4)Network Flow and Matching Algorithms (5)Shortest Path Algorithms (3)Traveling Salesman Tour Algorithms (3)ACM AreaAllAlgorithms and Complexity Theory (19)Computer Networking (1)Information Retrieval (1)Birth DateAll1910-06-22 (1)1927-09-23 (1)1928-01-29 (1)1930-05-11 (1)1935-01-03 (1)1936-06-08 (1)1939-10-07 (1)1944-10-25 (1)1948-04-30 (1)1950-06-08 (1)1951-12-18 (1)1967-05-01 (1)1973-03-26 (1)Birth YearAll1899 (1)1910 (1)1920 (1)1925 (1)1927 (1)1928 (1)1930 (1)1934 (1)1935 (1)1936 (1)1939 (1)1942 (1)1944 (1)1948 (1)1950 (1)1951 (1)1967 (1)1971 (1)1973 (1)1977 (1)Contribution KindAllAlgorithm (4)Hardware (1)Network (1)Theory (2)Death DateAll1995-12-18 (1)2001-09-25 (1)2002-08-06 (1)2010-09-19 (1)2017-02-26 (1)Death YearAll1995 (1)2001 (1)2002 (1)2010 (1)2017 (1)Highest HonourAllACM Fellow (1)ACM Prize in Computing (1)IEEE Medal of Honor (1)Israel Defense Prize (1)Turing Award (4)NationalityAllAmerican (4)Dutch (1)Show ResultsBrowseCompareDavid KargerCredited To1 entryEdsger W. DijkstraCredited To1 entryHarold W. KuhnCredited To1 entryJack EdmondsCredited To2 entriesJohn HopcroftCredited To1 entryJon KleinbergCredited To1 entryJoseph KruskalCredited To2 entriesK. Mani ChandyCredited To1 entryKonrad ZuseCredited To1 entryL. R. Ford Jr.Credited To1 entryLarry PageCredited To1 entryMicha SharirCredited To1 entryMichelle GirvanCredited To1 entryNicos ChristofidesCredited To1 entryOtakar BorůvkaCredited To1 entryRadia PerlmanCredited To1 entryRichard E. BellmanCredited To2 entriesRichard M. KarpCredited To2 entriesRobert TarjanCredited To1 entryRobert W. FloydCredited To2 entriesYefim DinitzCredited To1 entrySources1. 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.