Guarding a museum and guarding a graph
Speaker: Le Xuan Thanh

Time: 8h30, Thursday, June 7, 2018
Location: Room 212, Building A5, Institute of Mathematics
Absatract: We consider a problem of finding minimum number of guards to protect the interior of a museum whose boundary is of form of a simple polygon. In addition, we consider a cob-robber guarding game in a simple graph.


New Scientiffic Publications