CP5
Graph Theory: Algorithms and Computer Science II

1:30 On Optimal Average Message Passing Density in Generalised Petersen Graphs

Amit Anil Nanavati and S. Sitharama Iyengar, Louisiana State University

1:50 1-Edge Fault Tolerant Graphs

Shih-Yih Wang and Lih-Hsing Hsu, National Chiao Tung University, Republic of China; and Ting-Yi Sung, Academia Sinica, People's Republic of China

2:10 Randomized Greedy Matching in Weighted Graphs

Zevi Miller and Dan Pritikin, Miami University

2:30 Minimal Paths in Grids Amidst Movable Obstacles

A. Renuka and Kamala Krithivasan, Indian Institute of Technology, India

2:50 On Infinite Graph and Nonuniform Complexity

Yizhong Lu, Nanjing Aero/Astro. University, People's Republic of China; and Huicheng Sun, Nanjing University, People's Republic of China

Registration | Hotel Information | Dormitory Information | Transportation | Speaker Index