Graph Algorithms Applied to Materials Theory

3:45 PM-5:45 PM

*Room: Capitol South*

In past few years, use of methods from graph theory and optimisation in statistical physics has increased markedly. In particular, several hard problems in disordered systems have been related to "easy'' optimization problems, namely those that are precisely solvable in polynomial time. In this minsymposium, the speakers present an introduction to these mappings and their importance in statistical physics and materials theory. They will outline closely related problems for which no good algorithms currently exist.

**Organizer: Phillip M. Duxbury**

*Michigan State University*

**3:45-4:10 Mapping Materials Problems to Graph Algorithms**

- Phillip M. Duxbury, Organizer

**4:15-4:40 Min-Cut/Max-Flow Applied to Polycrystalline Materials**

- Elizabeth A. Holm, Sandia National Laboratories, Albuquerque

**4:45-5:10 Algorithms for Disordered Magnets and Flux Lines**

- Heiko Rieger, NIC Forschungszentrum/HLRZ, Juelich, Germany

**5:15-5:40 Generic Rigidity of Glasses and Proteins**

*Donald Jacobs*and Michael F. Thorpe, Michigan State University and MolFlex LLC

*LMH, 1/19/99, MMD, 3/26/99*