User contributions
- 01:50, 25 December 2019 (diff | hist) . . (+3,520) . . N Talk:Divide-TADM2E (Added solution to one of the problems.) (current)
- 01:47, 25 December 2019 (diff | hist) . . (-3,535) . . TADM2E 8.17 (Removed wrong solution in the wrong place)
- 01:46, 25 December 2019 (diff | hist) . . (+3,535) . . TADM2E 8.17 (Added the solution in Java, with different implementation details.)
- 09:55, 12 October 2019 (diff | hist) . . (+224) . . N TADM2E 7.5 (Created page with "This is no different than the graph isomorphism problem. You just have to add an extra backtracking step in the beginning to form every possible subgraph of the original graph...") (current)
- 19:57, 5 October 2019 (diff | hist) . . (+440) . . N Talk:Weighted-graphs-TADM2E (Created page with "(Solution 6.20) No, dijkstra's cant be applied to the longest path problem by changing minimum to maximum. By taking the longest possible edge at every iterat...") (current)
- 09:12, 10 February 2019 (diff | hist) . . (0) . . Talk:Graphs-TADM2E (current)
- 09:11, 10 February 2019 (diff | hist) . . (+1,128) . . Talk:Graphs-TADM2E (→TADM2E 5.3: new section)
- 03:25, 15 January 2019 (diff | hist) . . (-3) . . TADM2E 4.13 (Removed extra "of")
- 07:34, 12 December 2018 (diff | hist) . . (+29) . . m Talk:TADM2E 2.36 (→Proposed solution (with steps)) (current)
- 07:29, 12 December 2018 (diff | hist) . . (+12) . . TADM2E 2.36 (The previous answer was way off, this must be the correct one.)
