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-28

Splitting and Searching
Department of Computer Science
Harold (Hal) Gabow photo

The splitting operation for graphs is a simple yet powerful device. It is useful for proving theorems on graphs and designing efficient algorithms. Splitting was developed starting in the 1970's in Europe; it has recently begun to attract more attention. This talk surveys several representative applications of splitting: graph orientation, packing arborescences and multicommodity flow. We discuss theorems proved by splitting, and efficient algorithms based on the proofs.

One of our splitting algorithms involves a computation that can be done using n binary searches. We show how to reduce this to 1 binary search. We'll explain the method in detail, since it's quite simple. Surprisingly this binary search algorithm does not seem to have been previously known.

Refreshments will be served immediately before the talk at 3:30pm.

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)