Data Structures for Weighted Matching and Nearest Common ... · Title: Data Structures for Weighted...

Preview:

Citation preview

University of Colorado, BoulderCU Scholar

Computer Science Technical Reports Computer Science

Summer 6-1-1990

Data Structures for Weighted Matching andNearest Common Ancestors with Linking ; CU-CS-478-90Harold N. GabowUniversity of Colorado Boulder

Follow this and additional works at: http://scholar.colorado.edu/csci_techreports

This Technical Report is brought to you for free and open access by Computer Science at CU Scholar. It has been accepted for inclusion in ComputerScience Technical Reports by an authorized administrator of CU Scholar. For more information, please contact cuscholaradmin@colorado.edu.

Recommended CitationGabow, Harold N., "Data Structures for Weighted Matching and Nearest Common Ancestors with Linking ; CU-CS-478-90" (1990).Computer Science Technical Reports. 460.http://scholar.colorado.edu/csci_techreports/460

Recommended