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: |
LEADER | 00890cam a2200253 n 4500 | ||
---|---|---|---|
001 | 110709 | ||
005 | 20070123145000.0 | ||
008 | r1984 | ||
020 | |a 354013641X | ||
020 | |a 038713641X | ||
035 | |a (Sirsi) a99365 | ||
084 | 0 | |a MWD - Applied graph theory, network analysis |2 ZB | |
240 | 0 | 0 | |a Effiziente Algorithmen. |l EN. |
245 | 0 | 0 | |a Data structures and algorithms. |n 2. |p Graph algorithms and np completeness / |c Kurt Mehlhorn. |
260 | |a Berlin : |b Springer, |c 1984. | ||
300 | |a XII, 260 S. | ||
490 | 0 | |a EATCS monographs on theoretical computer science ; |v 2. | |
490 | 0 | |a Data structures and algorithms ; |v 2. | |
500 | |a englisch | ||
596 | |a 1 | ||
700 | 1 | |a Mehlhorn, Kurt. | |
900 | |a S 006050-0002'01' | ||
908 | |a Monographie, Sammelwerk | ||
949 | |a S 006050-0002'01' |w LC |c 1 |i 1085000591 |d 23/1/2007 |l STACKS |m ZB |r Y |s Y |t ZBB |u 25/3/2009 |x ZB-M |1 PRINT |