Timeline for Proving why decreasing an edge weight in a graph may change it's MST by one edge
Current License: CC BY-SA 4.0
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 3 at 18:48 | comment | added | John Kemeny | @KennethKho done | |
| Mar 3 at 14:10 | answer | added | John Kemeny | timeline score: 2 | |
| Feb 28 at 18:20 | comment | added | Kenneth Kho | @PålGD It would be great if you can answer using the cut property. | |
| Dec 19, 2022 at 6:03 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| Nov 19, 2022 at 5:39 | answer | added | User Not Found | timeline score: -1 | |
| Nov 18, 2022 at 23:30 | history | edited | DarkCave | CC BY-SA 4.0 |
added 9 characters in body
|
| Nov 18, 2022 at 23:28 | comment | added | DarkCave | Yes, in this case though because we're removing the highest weight edge to get the components of the cut and then adding the lowest weight. This seems like it's the opposite of the cut property so I'm not sure how to use the property in the proof. | |
| Nov 18, 2022 at 23:22 | comment | added | John Kemeny | Are you familiar with the cut property? | |
| Nov 18, 2022 at 23:19 | history | edited | DarkCave | CC BY-SA 4.0 |
edited title
|
| Nov 18, 2022 at 22:45 | history | asked | DarkCave | CC BY-SA 4.0 |