Friday, May 14

External Graph Algorithms

(Invited Minisymposium)
Sponsored by SIAM Activity Group on Supercomputing

10:30 AM-12:30 PM
Room: Savannah 3

External memory graph algorithms have applications in analyzing data from high-volume transaction systems, geographic information systems. Previous and current research efforts focus on providing external memory variants of classical algorithm and data structure techniques. When such techniques rely on data locality, however, they tend to extend poorly to the external memory setting. Thus there are new efforts to design wholly different approaches to solving graph problems in external memory. The speakers in this minisymposium will describe current algorithmic design efforts and current working systems.

Organizers: Adam L. Buchsbaum
AT&T Laboratories Research

10:30-10:55 Functional External Graph Algorithms
James Abello, AT&T Laboratories Research; Adam L. Buchsbaum, Organizer; and Jeffrey Westbrook, AT&T Laboratories Research
11:00-11:25 External Memory Graph Algorithms Using External Data Structures
Lars Arge, Duke University
11:30-11:55 Graph Data Types in Secondary Memory
Andreas Crauser, Max Planck Institut für Informatik, Saarbrücken, Germany
12:00-12:25 A Connectivity Server for the Web
Andrei Z. Broder and Puneet Kumar, Compaq Systems Research Center

AN99 Home


Program Updates

Speaker Index




tjf, 1/19/99, MMD, 2/2/99