Work

Data structures for weighted matching and nearest common ancestors with linking

Year: 1990

Type: conference-paper

Source: Symposium on Discrete Algorithms

DOI: 10.5555/320176.320229

Author: Harold N. Gabow

Institution: University of Colorado Boulder

Language: English

Topic: Complexity and Algorithms in Graphs

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: closed

OpenAlex ID: W2054420170

FWCI: 2.34

Cites: 30

Cited by: 398

Related to: 10