Data structures and algorithms. 2. Graph algorithms and np completeness / Kurt Mehlhorn.
Saved in:
Personal Name(s): | Mehlhorn, Kurt. |
---|---|
Imprint: |
Berlin :
Springer,
1984.
|
Physical Description: |
XII, 260 S. |
Note: |
englisch |
ISBN: |
9780387136417 9783540136415 038713641X 354013641X |
Series Title: |
/* Depending on the record driver, $field may either be an array with
"name" and "number" keys or a flat string containing only the series
name. We should account for both cases to maximize compatibility. */?>
EATCS monographs on theoretical computer science ;
2. /* Depending on the record driver, $field may either be an array with "name" and "number" keys or a flat string containing only the series name. We should account for both cases to maximize compatibility. */?> Data structures and algorithms ; 2. |
Classification: |
ZB | |
---|---|
Open Stacks Call number: S 006050-0002'01' Barcode: 1085000591 Available |