New pages
Jump to navigation
Jump to search
(newest | oldest) View (newer 20 | older 20) (20 | 50 | 100 | 250 | 500)
- 01:15, 21 September 2020 10.1 (hist) [24 bytes] Algowikiadmin (talk | contribs) (Created page with " Back to Chapter 10")
- 01:15, 21 September 2020 10.5 (hist) [24 bytes] Algowikiadmin (talk | contribs) (Created page with " Back to Chapter 10")
- 01:15, 21 September 2020 10.3 (hist) [24 bytes] Algowikiadmin (talk | contribs) (Created page with " Back to Chapter 10")
- 01:13, 21 September 2020 7.43 (hist) [23 bytes] Algowikiadmin (talk | contribs) (Created page with " Back to Chapter 7")
- 01:13, 21 September 2020 7.41 (hist) [23 bytes] Algowikiadmin (talk | contribs) (Created page with " Back to Chapter 7")
- 01:13, 21 September 2020 7.39 (hist) [23 bytes] Algowikiadmin (talk | contribs) (Created page with " Back to Chapter 7")
- 01:12, 21 September 2020 7.37 (hist) [3,727 bytes] Algowikiadmin (talk | contribs) (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 7.35 (hist) [23 bytes] Algowikiadmin (talk | contribs) (Created page with " Back to Chapter 7")
- 01:11, 21 September 2020 7.33 (hist) [23 bytes] Algowikiadmin (talk | contribs) (Created page with " Back to Chapter 7")
- 01:11, 21 September 2020 7.31 (hist) [23 bytes] Algowikiadmin (talk | contribs) (Created page with " Back to Chapter 7")
- 01:11, 21 September 2020 7.29 (hist) [23 bytes] Algowikiadmin (talk | contribs) (Created page with " Back to Chapter 7")
- 01:11, 21 September 2020 7.27 (hist) [23 bytes] Algowikiadmin (talk | contribs) (Created page with " Back to Chapter 7")
- 01:09, 21 September 2020 7.25 (hist) [334 bytes] Algowikiadmin (talk | contribs) (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 7.23 (hist) [1,381 bytes] Algowikiadmin (talk | contribs) (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 7.21 (hist) [2,464 bytes] Algowikiadmin (talk | contribs) (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 7.19 (hist) [232 bytes] Algowikiadmin (talk | contribs) (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 7.17 (hist) [1,498 bytes] Algowikiadmin (talk | contribs) (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 7.15 (hist) [23 bytes] Algowikiadmin (talk | contribs) (Created page with " Back to Chapter 7")
- 01:03, 21 September 2020 7.13 (hist) [23 bytes] Algowikiadmin (talk | contribs) (Created page with " Back to Chapter 7")
- 01:02, 21 September 2020 7.11 (hist) [23 bytes] Algowikiadmin (talk | contribs) (Created page with " Back to Chapter 7")