User contributions for Etone
Jump to navigation
Jump to search
5 September 2022
- 07:3107:31, 5 September 2022 diff hist +71 高级算法 (Fall 2022) →Lecture Notes
- 07:3107:31, 5 September 2022 diff hist +44,285 N 高级算法 (Fall 2022)/Min-Cut and Max-Cut Created page with "= Graph Cut = Let <math>G(V, E)</math> be an undirected graph. A subset <math>C\subseteq E</math> of edges is a '''cut''' of graph <math>G</math> if <math>G</math> becomes ''disconnected'' after deleting all edges in <math>C</math>. Let <math>\{S,T\}</math> be a '''bipartition''' of <math>V</math> into nonempty subsets <math>S,T\subseteq V</math>, where <math>S\cap T=\emptyset</math> and <math>S\cup T=V</math>. A cut <math>C</math> is specified by this bipartition as..." current
- 07:3007:30, 5 September 2022 diff hist +126 高级算法 (Fall 2022) →Lecture Notes
1 September 2022
- 05:0605:06, 1 September 2022 diff hist 0 Main Page No edit summary
30 August 2022
- 15:5815:58, 30 August 2022 diff hist −1 Main Page →Home Pages for Courses and Seminars
- 15:5815:58, 30 August 2022 diff hist +40 Main Page →Home Pages for Courses and Seminars
- 15:5815:58, 30 August 2022 diff hist −32 Main Page →Home Pages for Courses and Seminars
- 15:5715:57, 30 August 2022 diff hist +42 Main Page →Home Pages for Courses and Seminars
- 15:5615:56, 30 August 2022 diff hist −1 Main Page →Home Pages for Courses and Seminars
- 15:5615:56, 30 August 2022 diff hist −25 Main Page →Home Pages for Courses and Seminars
- 15:5615:56, 30 August 2022 diff hist 0 Main Page →Home Pages for Courses and Seminars
- 15:5515:55, 30 August 2022 diff hist −44 Main Page →Home Pages for Courses and Seminars