skip to main content
Department of Computer Science University of Colorado Boulder
cu: home | engineering | mycuinfo | about | cu a-z | search cu | contact cu cs: about | calendar | directory | catalog | schedules | mobile | contact cs
home · events · colloquia · 1995-1996 · 

Colloquium - Gabow

ECCR 2-26

Arborescence Packing: A Case Study in Algorithm Design
Department of Computer Science
Harold (Hal) Gabow photo

This talk examines a specific problem in algorithmic graph theory and surveys a number of efficient algorithms for it. The emphasis is to show generic techniques for algorithm design and graphs. These techniques, e.g., the greedy method, depth-first search, halving and NP-completeness, have widespread applicability; our packing problem illustrates just one possible use. The talk will be a survey, both of recent work on this specific problem and of fundamental techniques. As such we hope that the survey talk will interest both specialists in the area and those just seeking the flavor of algorithm design. The results we describe are theoretical in nature. However to be more down-to-earth we begin with a related real-life application, a system that schedules doctors' attending rounds.

The specific problem we focus on is finding the greatest possible number of edge-disjoint arborescences in a digraph. It is closely related to computing edge connectivity, computing the so-called "strength" of an undirected graph and related quantities. The relations are based on some interesting "minimax" theorems.

Refreshments will be served prior to the talk.

The Department holds colloquia throughout the Fall and Spring semesters. These colloquia, open to the public, are typically held on Thursday afternoons, but sometimes occur at other times as well. If you would like to receive email notification of upcoming colloquia, subscribe to our Colloquia Mailing List. If you would like to schedule a colloquium, see Colloquium Scheduling.

Sign language interpreters are available upon request. Please contact Stephanie Morris at least five days prior to the colloquium.

See also:
Department of Computer Science
College of Engineering and Applied Science
University of Colorado Boulder
Boulder, CO 80309-0430 USA
Send email to

Engineering Center Office Tower
ECOT 717
FAX +1-303-492-2844
XHTML 1.0/CSS2 ©2012 Regents of the University of Colorado
Privacy · Legal · Trademarks
May 5, 2012 (13:29)