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 · 1999-2000 · 
 

Colloquium - Gabow

 
10/28/1999
3:30pm-4:45pm
ECCR 265

How to Do Depth-first Search?
Department of Computer Science, University of Colorado
Harold (Hal) Gabow photo

Depth-first search is the basis of most algorithms for fundamental graph properties. We propose that depth-first search should be conceptualized according to the natural intuitive view. This is not how DFS is currently taught and it is not how previous DFS algorithms work. To support the proposal we describe an efficient DFS algorithm for finding strong components. There are similar algorithms for other fundamental graph properties. We contrast the new algorithm with traditional ones.

No background in graph algorithms will be assumed.
Refreshments will be served in ECOT 831 immediately following the talk.
Hosted by Clarence (Skip) Ellis.


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
Questions/Comments?
Send email to

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