|
University of Bonn -> Department of Computer Science -> Chair V | ||
CS-Reports 1985-1989 | Copyright 1985-1989 University of Bonn, Department of Computer Science, Abt. V | |
8512 01.12.2008 |
On the Parallel Complexity of Matching for Chordal and Path Graphs
Elias Dahlhaus and Marek Karpinski [Download PostScript] [Download PDF]
|
|
Last Change:
12/01/08 at 15:55:24
Deutsch |
University of Bonn -> Department of Computer Science -> Chair V |