Title: Min/Max Mean Path Problem

Speaker:  Zhu Hong
Fudan University 
Date: Friday, November 30, 2007
Time 11:00-12:00PM
Venue: Room 3464, HKUST

 
Abstract:
Recently, a lot of efforts have been devoted to  research on
social networks. In this talk, a new model of social networks 
will be proposed: trustworthy networks. This model asks the 
maximum trustworthy degree between two agents, which can be 
reduced to an interesting problem in
graph theory: maxmum/minimum mean path problems. We will 
present some related problems and
the hardness result of these problems.