User contributions
Jump to navigation
Jump to search
- 18:05, 1 October 2020 diff hist 0 m Chapter 1 Protected "Chapter 1" ([Edit=Allow only administrators] (indefinite) [Move=Allow only administrators] (indefinite)) current
- 18:05, 1 October 2020 diff hist 0 m Main Page Protected "Main Page" ([Edit=Allow only administrators] (indefinite) [Move=Allow only administrators] (indefinite))
- 18:01, 1 October 2020 diff hist -1 Main Page
- 18:01, 1 October 2020 diff hist +6 Main Page →Chapters
- 18:00, 1 October 2020 diff hist +364 Main Page
- 17:55, 28 September 2020 diff hist +1 Main Page
- 17:54, 28 September 2020 diff hist +65 Main Page
- 17:39, 28 September 2020 diff hist +238 Chapter List
- 17:37, 28 September 2020 diff hist +1 Chapter 3 →Data Structure
- 17:32, 28 September 2020 diff hist +72 N User:Algowikiadmin Created page with "This admin account belongs to those that created and moderate this Wiki." current
- 17:29, 28 September 2020 diff hist +95 Main Page
- 17:27, 28 September 2020 diff hist +27 Main Page
- 17:26, 28 September 2020 diff hist +713 Main Page
- 14:13, 21 September 2020 diff hist 0 Chapter 8 →Shortest Paths
- 14:12, 21 September 2020 diff hist +238 N 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..." current
- 14:12, 21 September 2020 diff hist +438 N 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..." current
- 14:11, 21 September 2020 diff hist +561 N 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..." current
- 14:10, 21 September 2020 diff hist +23 N 8.23 Created page with " Back to Chapter 8" current
- 14:10, 21 September 2020 diff hist +1 Chapter 8 →Shortest Paths
- 14:09, 21 September 2020 diff hist +23 N 8.21 Created page with " Back to Chapter 8" current
- 14:09, 21 September 2020 diff hist +23 N 8.19 Created page with " Back to Chapter 8" current
- 14:09, 21 September 2020 diff hist +23 N 8.17 Created page with " Back to Chapter 8" current
- 14:09, 21 September 2020 diff hist +23 N 8.15 Created page with " Back to Chapter 8" current
- 14:08, 21 September 2020 diff hist +18 Chapter 8 →Shortest Paths
- 14:07, 21 September 2020 diff hist +23 N 8.13 Created page with " Back to Chapter 8" current
- 14:07, 21 September 2020 diff hist +23 N 8.11 Created page with " Back to Chapter 8" current
- 14:07, 21 September 2020 diff hist +23 N 8.9 Created page with " Back to Chapter 8" current
- 14:07, 21 September 2020 diff hist +23 N 8.7 Created page with " Back to Chapter 8" current
- 14:06, 21 September 2020 diff hist +252 N 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..." current
- 14:06, 21 September 2020 diff hist +252 N 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..." current
- 14:04, 21 September 2020 diff hist +23 N 8.1 Created page with " Back to Chapter 8" current
- 14:02, 21 September 2020 diff hist +2,114 N 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..." current
- 14:02, 21 September 2020 diff hist +23 N 9.31 Created page with " Back to Chapter 9" current
- 14:02, 21 September 2020 diff hist +23 N 9.29 Created page with " Back to Chapter 9" current
- 14:01, 21 September 2020 diff hist +23 N 9.27 Created page with " Back to Chapter 9" current
- 14:01, 21 September 2020 diff hist +23 N 9.25 Created page with " Back to Chapter 9" current
- 14:01, 21 September 2020 diff hist +23 N 9.23 Created page with " Back to Chapter 9" current
- 14:01, 21 September 2020 diff hist +23 N 9.21 Created page with " Back to Chapter 9" current
- 14:00, 21 September 2020 diff hist +1 Chapter 9 →Combinatorial Optimization
- 14:00, 21 September 2020 diff hist +23 N 9.19 Created page with " Back to Chapter 9" current
- 14:00, 21 September 2020 diff hist +23 N 9.17 Created page with " Back to Chapter 9" current
- 14:00, 21 September 2020 diff hist +23 N 9.15 Created page with " Back to Chapter 9" current
- 14:00, 21 September 2020 diff hist +23 N 9.13 Created page with " Back to Chapter 9" current
- 14:00, 21 September 2020 diff hist +23 N 9.11 Created page with " Back to Chapter 9" current
- 13:52, 21 September 2020 diff hist +23 N 9.9 Created page with " Back to Chapter 9" current
- 13:52, 21 September 2020 diff hist +23 N 9.7 Created page with " Back to Chapter 9" current
- 13:52, 21 September 2020 diff hist +23 N 9.5 Created page with " Back to Chapter 9" current
- 13:51, 21 September 2020 diff hist +23 N 9.3 Created page with " Back to Chapter 9" current
- 13:51, 21 September 2020 diff hist +1,837 N 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..." current
- 13:49, 21 September 2020 diff hist +3,139 N 10.39 Created page with "== A Python Solution - O(1) == <PRE> import sys n = int(sys.argv[1]) OUT_TMP = "Min # of coins for covering %d: %d, coins used: %s" COINS = tuple(sorted((3, 4, 9, 20, 22, 23)..." current
- 13:49, 21 September 2020 diff hist +24 N 10.41 Created page with " Back to Chapter 10" current
- 13:48, 21 September 2020 diff hist +24 N 10.37 Created page with " Back to Chapter 10" current
- 13:48, 21 September 2020 diff hist +1,158 Chapter 10 →Design Problems
- 13:44, 21 September 2020 diff hist +24 N 10.35 Created page with " Back to Chapter 10" current
- 13:44, 21 September 2020 diff hist +24 N 10.33 Created page with " Back to Chapter 10" current
- 13:44, 21 September 2020 diff hist +24 N 10.31 Created page with " Back to Chapter 10" current
- 13:44, 21 September 2020 diff hist +24 N 10.29 Created page with " Back to Chapter 10" current
- 13:44, 21 September 2020 diff hist +24 N 10.27 Created page with " Back to Chapter 10" current
- 13:42, 21 September 2020 diff hist -1 Chapter 10 →Number Problems
- 13:41, 21 September 2020 diff hist 0 m 10.25 Algowikiadmin moved page 10.125 to 10.25 current
- 13:40, 21 September 2020 diff hist +24 N 10.25 Created page with " Back to Chapter 10"
- 13:40, 21 September 2020 diff hist +24 N 10.23 Created page with " Back to Chapter 10" current
- 13:40, 21 September 2020 diff hist +24 N 10.21 Created page with " Back to Chapter 10" current
- 13:39, 21 September 2020 diff hist +24 N 10.19 Created page with " Back to Chapter 10" current
- 13:39, 21 September 2020 diff hist +24 N 10.17 Created page with " Back to Chapter 10" current
- 01:31, 21 September 2020 diff hist +24 N 10.15 Created page with " Back to Chapter 10" current
- 01:29, 21 September 2020 diff hist -9 Chapter 10 →Number Problems
- 01:19, 21 September 2020 diff hist +2 Chapter 10 →Number Problems
- 01:17, 21 September 2020 diff hist +534 N 10.11 Created page with "Answer to both a) and b) is no. Knapsack problem is NP-complete. ---- (a) Yes, this is a special case of the Knapsack problem where the value of each item is the same (desc..." current
- 01:17, 21 September 2020 diff hist +2,566 N 10.13 Created page with "==== 1 ==== # 20 x 1 # 1 x 6 + 14 x 1 # 2 x 6 + 8 x 1 # 3 x 6 + 2 x 1 # 1 x 10 + 10 x 1 # 1 x 10 + 1 x 6 + 4 x 1 # 2 x 10 ==== 2 ==== More generally: # there is always o..." current
- 01:16, 21 September 2020 diff hist +24 N 10.9 Created page with " Back to Chapter 10" current
- 01:16, 21 September 2020 diff hist +24 N 10.7 Created page with " Back to Chapter 10" current
- 01:15, 21 September 2020 diff hist +24 N 10.1 Created page with " Back to Chapter 10" current
- 01:15, 21 September 2020 diff hist +24 N 10.5 Created page with " Back to Chapter 10" current
- 01:15, 21 September 2020 diff hist +24 N 10.3 Created page with " Back to Chapter 10" current
- 01:13, 21 September 2020 diff hist +23 N 7.43 Created page with " Back to Chapter 7" current
- 01:13, 21 September 2020 diff hist +23 N 7.41 Created page with " Back to Chapter 7" current
- 01:13, 21 September 2020 diff hist +23 N 7.39 Created page with " Back to Chapter 7" current
- 01:12, 21 September 2020 diff hist +3,727 N 7.37 Created page with "Proof by induction. A tournament with 2 vertices (1,2) has a Hamiltonian path. 1 -> 2 or vice versa Now suppose our tournament with n vertices has a Hamiltonian path 1,..,n...." current
- 01:11, 21 September 2020 diff hist +23 N 7.35 Created page with " Back to Chapter 7" current
- 01:11, 21 September 2020 diff hist +23 N 7.33 Created page with " Back to Chapter 7" current
- 01:11, 21 September 2020 diff hist +23 N 7.31 Created page with " Back to Chapter 7" current
- 01:11, 21 September 2020 diff hist +23 N 7.29 Created page with " Back to Chapter 7" current
- 01:11, 21 September 2020 diff hist +23 N 7.27 Created page with " Back to Chapter 7" current
- 01:09, 21 September 2020 diff hist +334 N 7.25 Created page with "Use the BFS starting from the vertex v. For every node keep track of the level from the vertex v. When w is encountered for the first time the level of w is the length of the..." current
- 01:07, 21 September 2020 diff hist +1,381 N 7.23 Created page with " for any node in the tree, there are two possibilities # either the diameter is contained in one of the subtrees # or the node itself is at the top of the longest path in the..." current
- 01:06, 21 September 2020 diff hist +2,464 N 7.21 Created page with "(a) Compare every possible set of three vertices and test if there is an edge between the three. (b) One may be tempted to use DFS to find cycle of length 3, by maintaining a..." current
- 01:06, 21 September 2020 diff hist -1 Chapter 7 →Algorithm Design
- 01:05, 21 September 2020 diff hist +232 N 7.19 Created page with "# This translates to the question of labeling the tree with two colors, because this way each edge's vertices are colored differently. The larger group of colors is the sought..." current
- 01:04, 21 September 2020 diff hist +1,498 N 7.17 Created page with "1) We can determine that leafs should never be included into the cover. Therefore all leaves should be unmarked, which means that all of their parents should be marked. Now we..." current
- 01:03, 21 September 2020 diff hist +23 N 7.15 Created page with " Back to Chapter 7" current
- 01:03, 21 September 2020 diff hist +23 N 7.13 Created page with " Back to Chapter 7" current
- 01:02, 21 September 2020 diff hist +23 N 7.11 Created page with " Back to Chapter 7" current
- 01:02, 21 September 2020 diff hist +23 N 7.9 Created page with " Back to Chapter 7" current
- 01:01, 21 September 2020 diff hist +23 N 7.7 Created page with " Back to Chapter 7" current
- 01:01, 21 September 2020 diff hist +1,169 N 7.5 Created page with "Graphs with max degree 2, can be bipartite (even number of edges) or tripartite (odd number of edges) ----- Consider a triangle (3 edges, 3 vertices): it's not bipartite eve..." current
- 01:00, 21 September 2020 diff hist +325 N 7.3 Created page with "Induction proof: Base case: Tree composed of just two nodes: x(root) and y. There is only one way x -> y Assuming there is an unique path between x and y, we add a new leaf..." current
- 00:59, 21 September 2020 diff hist +241 N 7.1 Created page with "(a) BFS: * Graph G1: A, B, D, I, C, E, G, J, F, H * Graph G2: A, B, E, C, F, I, D, G, J, M, H, K, N, L, O, P (b) DFS: * Graph G1: A, B, C, E, D, G, H, F, J, I * Graph G2: A,..." current
- 00:58, 21 September 2020 diff hist +23 N 6.11 Created page with " Back to Chapter 6" current
- 00:58, 21 September 2020 diff hist +23 N 6.9 Created page with " Back to Chapter 6" current