张贸翔-Graph ClassesA Survey.ppt

Graph ClassesA Survey 張貿翔 中正大學資訊工程學系 Meeting Room Reservation One meeting room Reservation: Gary 10:00~11:00 Mary 10:30~12:00 Jones 13:30~14:30 Amy 14:00~15:30 David 11:00~12:30 Tom 12:00~14:30 To satisfy as many as possible The maximum Independent Set Problem in Graphs An independent set ● ● Another independent set ● ● A maximum independent set ● ● ● The meeting room reservation problem is reduced to the maximum independent set problem in graphs. The maximum independent set problem in general graphs is NP-hard. Most of optimization problems in graphs are NP-hard. It turns out that th