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 20 | older 20) (20 | 50 | 100 | 250 | 500)- 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...")