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).
(newest | oldest) View (newer 50 | older 50) (20 | 50 | 100 | 250 | 500)- 21:10, 8 October 2020 User account Ebarker talk contribs was created by Algowikiadmin talk contribs and password was sent by email
- 00:32, 3 October 2020 User account Benwu talk contribs was created by Algowikiadmin talk contribs and password was sent by email
- 18:38, 1 October 2020 User account Zypan talk contribs was created by Algowikiadmin talk contribs and password was sent by email
- 18:11, 1 October 2020 Algowikiadmin talk contribs protected Chapter 2 [Edit=Allow only administrators] (indefinite) [Move=Allow only administrators] (indefinite) (hist)
- 18:11, 1 October 2020 Algowikiadmin talk contribs protected Chapter 12 [Edit=Allow only administrators] (indefinite) [Move=Allow only administrators] (indefinite) (hist)
- 18:10, 1 October 2020 Algowikiadmin talk contribs protected Chapter 11 [Edit=Allow only administrators] (indefinite) [Move=Allow only administrators] (indefinite) (hist)
- 18:10, 1 October 2020 Algowikiadmin talk contribs protected Chapter 10 [Edit=Allow only administrators] (indefinite) [Move=Allow only administrators] (indefinite) (hist)
- 18:10, 1 October 2020 Algowikiadmin talk contribs protected Chapter 9 [Edit=Allow only administrators] (indefinite) [Move=Allow only administrators] (indefinite) (hist)
- 18:09, 1 October 2020 Algowikiadmin talk contribs protected Chapter 8 [Edit=Allow only administrators] (indefinite) [Move=Allow only administrators] (indefinite) (hist)
- 18:08, 1 October 2020 Algowikiadmin talk contribs protected Chapter 7 [Edit=Allow only administrators] (indefinite) [Move=Allow only administrators] (indefinite) (hist)
- 18:08, 1 October 2020 Algowikiadmin talk contribs protected Chapter 6 [Edit=Allow only administrators] (indefinite) [Move=Allow only administrators] (indefinite) (hist)
- 18:08, 1 October 2020 Algowikiadmin talk contribs protected Chapter 5 [Edit=Allow only administrators] (indefinite) [Move=Allow only administrators] (indefinite) (hist)
- 18:06, 1 October 2020 Algowikiadmin talk contribs protected Chapter 4 [Edit=Allow only administrators] (indefinite) [Move=Allow only administrators] (indefinite) (hist)
- 18:06, 1 October 2020 Algowikiadmin talk contribs protected Chapter 3 [Edit=Allow only administrators] (indefinite) [Move=Allow only administrators] (indefinite) (hist)
- 18:06, 1 October 2020 Algowikiadmin talk contribs protected Chapter List [Edit=Allow only administrators] (indefinite) [Move=Allow only administrators] (indefinite) (hist)
- 18:05, 1 October 2020 Algowikiadmin talk contribs protected Chapter 1 [Edit=Allow only administrators] (indefinite) [Move=Allow only administrators] (indefinite) (hist)
- 18:05, 1 October 2020 Algowikiadmin talk contribs protected Main Page [Edit=Allow only administrators] (indefinite) [Move=Allow only administrators] (indefinite) (hist)
- 17:32, 28 September 2020 Algowikiadmin talk contribs 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 talk contribs 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 talk contribs 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 talk contribs 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 talk contribs created page 8.23 (Created page with " Back to Chapter 8")
- 14:09, 21 September 2020 Algowikiadmin talk contribs created page 8.21 (Created page with " Back to Chapter 8")
- 14:09, 21 September 2020 Algowikiadmin talk contribs created page 8.19 (Created page with " Back to Chapter 8")
- 14:09, 21 September 2020 Algowikiadmin talk contribs created page 8.17 (Created page with " Back to Chapter 8")
- 14:09, 21 September 2020 Algowikiadmin talk contribs created page 8.15 (Created page with " Back to Chapter 8")
- 14:07, 21 September 2020 Algowikiadmin talk contribs created page 8.13 (Created page with " Back to Chapter 8")
- 14:07, 21 September 2020 Algowikiadmin talk contribs created page 8.11 (Created page with " Back to Chapter 8")
- 14:07, 21 September 2020 Algowikiadmin talk contribs created page 8.9 (Created page with " Back to Chapter 8")
- 14:07, 21 September 2020 Algowikiadmin talk contribs created page 8.7 (Created page with " Back to Chapter 8")
- 14:06, 21 September 2020 Algowikiadmin talk contribs 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 talk contribs 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 talk contribs created page 8.1 (Created page with " Back to Chapter 8")
- 14:02, 21 September 2020 Algowikiadmin talk contribs 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 talk contribs created page 9.31 (Created page with " Back to Chapter 9")
- 14:02, 21 September 2020 Algowikiadmin talk contribs created page 9.29 (Created page with " Back to Chapter 9")
- 14:01, 21 September 2020 Algowikiadmin talk contribs created page 9.27 (Created page with " Back to Chapter 9")
- 14:01, 21 September 2020 Algowikiadmin talk contribs created page 9.25 (Created page with " Back to Chapter 9")
- 14:01, 21 September 2020 Algowikiadmin talk contribs created page 9.23 (Created page with " Back to Chapter 9")
- 14:01, 21 September 2020 Algowikiadmin talk contribs created page 9.21 (Created page with " Back to Chapter 9")
- 14:00, 21 September 2020 Algowikiadmin talk contribs created page 9.19 (Created page with " Back to Chapter 9")
- 14:00, 21 September 2020 Algowikiadmin talk contribs created page 9.17 (Created page with " Back to Chapter 9")
- 14:00, 21 September 2020 Algowikiadmin talk contribs created page 9.15 (Created page with " Back to Chapter 9")
- 14:00, 21 September 2020 Algowikiadmin talk contribs created page 9.13 (Created page with " Back to Chapter 9")
- 14:00, 21 September 2020 Algowikiadmin talk contribs created page 9.11 (Created page with " Back to Chapter 9")
- 13:52, 21 September 2020 Algowikiadmin talk contribs created page 9.9 (Created page with " Back to Chapter 9")
- 13:52, 21 September 2020 Algowikiadmin talk contribs created page 9.7 (Created page with " Back to Chapter 9")
- 13:52, 21 September 2020 Algowikiadmin talk contribs created page 9.5 (Created page with " Back to Chapter 9")
- 13:51, 21 September 2020 Algowikiadmin talk contribs created page 9.3 (Created page with " Back to Chapter 9")
- 13:51, 21 September 2020 Algowikiadmin talk contribs created page 9.1 (Created page with "== Algorithm == Given <code>a</code>, the input array, and <code>curr</code>, the derangement built up so far: # If <code>curr</code> represents a complete solution, print i...")
