All public logs

Jump to navigation Jump to search

Combined display of all available logs of The Algorithm Design Manual Solution Wiki. You can narrow down the view by selecting a log type, the username (case-sensitive), or the affected page (also case-sensitive).

Logs
(newest | oldest) View (newer 50 | ) (20 | 50 | 100 | 250 | 500)
• 23:47, 19 September 2021 User account Test1 was created
• 18:13, 28 October 2020 Algowikiadmin deleted page Solution Wiki, TheAlgorithm Design Manual, 3rd Edition (content was: "The Wiki is an experiment, a grass-roots effort to create an answer key to aid self-study with the third edition of Steven Skiena's ''The Algorithm Design Manual''. Students and other readers are encouraged to contribute hints and answers to all odd-numbered problems in the book, or expand/improve the solution contributed by others. Please do not use this re...", and the only contributor was "Algowikiadmin" (talk))
• 18:09, 28 October 2020 Algowikiadmin created page Solution Wiki, The Algorithm Design Manual, 3rd Edition (Created page with " The Wiki is an experiment, a grass-roots effort to create an answer key to aid self-study with the third edition of Steven Skiena's ''The Algorithm Design Manual''. Students...")
• 14:38, 26 October 2020 Algowikiadmin deleted page Solution Wiki, TheAlgorithm Design Manual, 3rd Edition" (Broken redirect)
• 14:37, 26 October 2020 Algowikiadmin created page Solution Wiki, TheAlgorithm Design Manual, 3rd Edition (Created page with "The Wiki is an experiment, a grass-roots effort to create an answer key to aid self-study with the third edition of Steven Skiena's ''The Algorithm Design Manual''. Students a...")
• 14:36, 26 October 2020 Algowikiadmin created page Solution Wiki, TheAlgorithm Design Manual, 3rd Edition" (Created page with "The Wiki is an experiment, a grass-roots effort to create an answer key to aid self-study with the third edition of Steven Skiena's ''The Algorithm Design Manual''. Students a...")
• 21:10, 8 October 2020 User account Ebarker was created by Algowikiadmin and password was sent by email
• 00:32, 3 October 2020 User account Benwu was created by Algowikiadmin and password was sent by email
• 18:38, 1 October 2020 User account Zypan was created by Algowikiadmin and password was sent by email
• 18:11, 1 October 2020 Algowikiadmin protected Chapter 2 [Edit=Allow only administrators] (indefinite) [Move=Allow only administrators] (indefinite) (hist)
• 18:11, 1 October 2020 Algowikiadmin protected Chapter 12 [Edit=Allow only administrators] (indefinite) [Move=Allow only administrators] (indefinite) (hist)
• 18:10, 1 October 2020 Algowikiadmin protected Chapter 11 [Edit=Allow only administrators] (indefinite) [Move=Allow only administrators] (indefinite) (hist)
• 18:10, 1 October 2020 Algowikiadmin protected Chapter 10 [Edit=Allow only administrators] (indefinite) [Move=Allow only administrators] (indefinite) (hist)
• 18:10, 1 October 2020 Algowikiadmin protected Chapter 9 [Edit=Allow only administrators] (indefinite) [Move=Allow only administrators] (indefinite) (hist)
• 18:09, 1 October 2020 Algowikiadmin protected Chapter 8 [Edit=Allow only administrators] (indefinite) [Move=Allow only administrators] (indefinite) (hist)
• 18:08, 1 October 2020 Algowikiadmin protected Chapter 7 [Edit=Allow only administrators] (indefinite) [Move=Allow only administrators] (indefinite) (hist)
• 18:08, 1 October 2020 Algowikiadmin protected Chapter 6 [Edit=Allow only administrators] (indefinite) [Move=Allow only administrators] (indefinite) (hist)
• 18:08, 1 October 2020 Algowikiadmin protected Chapter 5 [Edit=Allow only administrators] (indefinite) [Move=Allow only administrators] (indefinite) (hist)
• 18:06, 1 October 2020 Algowikiadmin protected Chapter 4 [Edit=Allow only administrators] (indefinite) [Move=Allow only administrators] (indefinite) (hist)
• 18:06, 1 October 2020 Algowikiadmin protected Chapter 3 [Edit=Allow only administrators] (indefinite) [Move=Allow only administrators] (indefinite) (hist)
• 18:06, 1 October 2020 Algowikiadmin protected Chapter List [Edit=Allow only administrators] (indefinite) [Move=Allow only administrators] (indefinite) (hist)
• 18:05, 1 October 2020 Algowikiadmin protected Chapter 1 [Edit=Allow only administrators] (indefinite) [Move=Allow only administrators] (indefinite) (hist)
• 18:05, 1 October 2020 Algowikiadmin protected Main Page [Edit=Allow only administrators] (indefinite) [Move=Allow only administrators] (indefinite) (hist)
• 17:32, 28 September 2020 Algowikiadmin created page User:Algowikiadmin (Created page with "This admin account belongs to those that created and moderate this Wiki.")
• 14:12, 21 September 2020 Algowikiadmin created page 8.29 (Created page with "1. Find maximum matching. Bipartite matching is described in the book. General matching would require Edmonds Blossom algorithm. 2. Include an arbitrary edge for every uncover...")
• 14:12, 21 September 2020 Algowikiadmin created page 8.27 (Created page with "The problem reduces to Floyd - Warshall algorithm if you take logs of all currency-exchange rates, as if a * b = c then ln(a) + ln(b) = ln(c). In computational finance people...")
• 14:11, 21 September 2020 Algowikiadmin created page 8.25 (Created page with "Step 1: Perform topological sorting of the graph (we can do it as Graph is acyclic). This is O(n + m) Step 2: Go through vertices in topological order. Initially all vertic...")
• 14:10, 21 September 2020 Algowikiadmin created page 8.23 (Created page with " Back to Chapter 8")
• 14:09, 21 September 2020 Algowikiadmin created page 8.21 (Created page with " Back to Chapter 8")
• 14:09, 21 September 2020 Algowikiadmin created page 8.19 (Created page with " Back to Chapter 8")
• 14:09, 21 September 2020 Algowikiadmin created page 8.17 (Created page with " Back to Chapter 8")
• 14:09, 21 September 2020 Algowikiadmin created page 8.15 (Created page with " Back to Chapter 8")
• 14:07, 21 September 2020 Algowikiadmin created page 8.13 (Created page with " Back to Chapter 8")
• 14:07, 21 September 2020 Algowikiadmin created page 8.11 (Created page with " Back to Chapter 8")
• 14:07, 21 September 2020 Algowikiadmin created page 8.9 (Created page with " Back to Chapter 8")
• 14:07, 21 September 2020 Algowikiadmin created page 8.7 (Created page with " Back to Chapter 8")
• 14:06, 21 September 2020 Algowikiadmin created page 8.5 (Created page with "In both algorithms, an edge can only ever be picked once, so they will both eventually terminate regardless of negative edge weights. I also suspect that they still generate...")
• 14:06, 21 September 2020 Algowikiadmin created page 8.3 (Created page with "No. Counter example provided below: G(V,E,W) = ((A,B,C,D),({A,B},{B,C},{C,D},{D,A}),(1,2,3,4)) Minimum spanning tree has a weight of 6 with edges {A,B},{B,C},{C,D}. In the...")
• 14:04, 21 September 2020 Algowikiadmin created page 8.1 (Created page with " Back to Chapter 8")
• 14:02, 21 September 2020 Algowikiadmin created page 9.33 (Created page with "We avoid sums and products and throw away parts of the sample space we don't need. At the same time, we want to be efficient in our use of the space. Conceptually we create a...")
• 14:02, 21 September 2020 Algowikiadmin created page 9.31 (Created page with " Back to Chapter 9")
• 14:02, 21 September 2020 Algowikiadmin created page 9.29 (Created page with " Back to Chapter 9")
• 14:01, 21 September 2020 Algowikiadmin created page 9.27 (Created page with " Back to Chapter 9")
• 14:01, 21 September 2020 Algowikiadmin created page 9.25 (Created page with " Back to Chapter 9")
• 14:01, 21 September 2020 Algowikiadmin created page 9.23 (Created page with " Back to Chapter 9")
• 14:01, 21 September 2020 Algowikiadmin created page 9.21 (Created page with " Back to Chapter 9")
• 14:00, 21 September 2020 Algowikiadmin created page 9.19 (Created page with " Back to Chapter 9")
• 14:00, 21 September 2020 Algowikiadmin created page 9.17 (Created page with " Back to Chapter 9")
• 14:00, 21 September 2020 Algowikiadmin created page 9.15 (Created page with " Back to Chapter 9")
• 14:00, 21 September 2020 Algowikiadmin created page 9.13 (Created page with " Back to Chapter 9")
(newest | oldest) View (newer 50 | ) (20 | 50 | 100 | 250 | 500)