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)- 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...")
- 13:49, 21 September 2020 Algowikiadmin talk contribs created page 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)...")
- 13:49, 21 September 2020 Algowikiadmin talk contribs created page 10.41 (Created page with " Back to Chapter 10")
- 13:48, 21 September 2020 Algowikiadmin talk contribs created page 10.37 (Created page with " Back to Chapter 10")
- 13:44, 21 September 2020 Algowikiadmin talk contribs created page 10.35 (Created page with " Back to Chapter 10")
- 13:44, 21 September 2020 Algowikiadmin talk contribs created page 10.33 (Created page with " Back to Chapter 10")
- 13:44, 21 September 2020 Algowikiadmin talk contribs created page 10.31 (Created page with " Back to Chapter 10")
- 13:44, 21 September 2020 Algowikiadmin talk contribs created page 10.29 (Created page with " Back to Chapter 10")
- 13:44, 21 September 2020 Algowikiadmin talk contribs created page 10.27 (Created page with " Back to Chapter 10")
- 13:42, 21 September 2020 Algowikiadmin talk contribs deleted page 10.125 (content was: "#REDIRECT 10.25", and the only contributor was "Algowikiadmin" (talk))
- 13:41, 21 September 2020 Algowikiadmin talk contribs moved page 10.125 to 10.25
- 13:40, 21 September 2020 Algowikiadmin talk contribs created page 10.125 (Created page with " Back to Chapter 10")
- 13:40, 21 September 2020 Algowikiadmin talk contribs created page 10.23 (Created page with " Back to Chapter 10")
- 13:40, 21 September 2020 Algowikiadmin talk contribs created page 10.21 (Created page with " Back to Chapter 10")
- 13:39, 21 September 2020 Algowikiadmin talk contribs created page 10.19 (Created page with " Back to Chapter 10")
- 13:39, 21 September 2020 Algowikiadmin talk contribs created page 10.17 (Created page with " Back to Chapter 10")
- 01:31, 21 September 2020 Algowikiadmin talk contribs created page 10.15 (Created page with " Back to Chapter 10")
- 01:17, 21 September 2020 Algowikiadmin talk contribs created page 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...")
- 01:17, 21 September 2020 Algowikiadmin talk contribs created page 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...")
- 01:16, 21 September 2020 Algowikiadmin talk contribs created page 10.9 (Created page with " Back to Chapter 10")
- 01:16, 21 September 2020 Algowikiadmin talk contribs created page 10.7 (Created page with " Back to Chapter 10")
- 01:15, 21 September 2020 Algowikiadmin talk contribs created page 10.1 (Created page with " Back to Chapter 10")
- 01:15, 21 September 2020 Algowikiadmin talk contribs created page 10.5 (Created page with " Back to Chapter 10")
- 01:15, 21 September 2020 Algowikiadmin talk contribs created page 10.3 (Created page with " Back to Chapter 10")
- 01:13, 21 September 2020 Algowikiadmin talk contribs created page 7.43 (Created page with " Back to Chapter 7")
- 01:13, 21 September 2020 Algowikiadmin talk contribs created page 7.41 (Created page with " Back to Chapter 7")
- 01:13, 21 September 2020 Algowikiadmin talk contribs created page 7.39 (Created page with " Back to Chapter 7")
- 01:12, 21 September 2020 Algowikiadmin talk contribs created page 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....")
- 01:11, 21 September 2020 Algowikiadmin talk contribs created page 7.35 (Created page with " Back to Chapter 7")
- 01:11, 21 September 2020 Algowikiadmin talk contribs created page 7.33 (Created page with " Back to Chapter 7")
- 01:11, 21 September 2020 Algowikiadmin talk contribs created page 7.31 (Created page with " Back to Chapter 7")
- 01:11, 21 September 2020 Algowikiadmin talk contribs created page 7.29 (Created page with " Back to Chapter 7")
- 01:11, 21 September 2020 Algowikiadmin talk contribs created page 7.27 (Created page with " Back to Chapter 7")
- 01:09, 21 September 2020 Algowikiadmin talk contribs created page 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...")
- 01:07, 21 September 2020 Algowikiadmin talk contribs created page 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...")
- 01:06, 21 September 2020 Algowikiadmin talk contribs created page 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...")
- 01:05, 21 September 2020 Algowikiadmin talk contribs created page 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...")
- 01:04, 21 September 2020 Algowikiadmin talk contribs created page 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...")
- 01:03, 21 September 2020 Algowikiadmin talk contribs created page 7.15 (Created page with " Back to Chapter 7")
- 01:03, 21 September 2020 Algowikiadmin talk contribs created page 7.13 (Created page with " Back to Chapter 7")
- 01:02, 21 September 2020 Algowikiadmin talk contribs created page 7.11 (Created page with " Back to Chapter 7")
- 01:02, 21 September 2020 Algowikiadmin talk contribs created page 7.9 (Created page with " Back to Chapter 7")
- 01:01, 21 September 2020 Algowikiadmin talk contribs created page 7.7 (Created page with " Back to Chapter 7")
- 01:01, 21 September 2020 Algowikiadmin talk contribs created page 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...")
- 01:00, 21 September 2020 Algowikiadmin talk contribs created page 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...")
- 00:59, 21 September 2020 Algowikiadmin talk contribs created page 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,...")
