|
Journal description
All volumes of the corresponding journal
All issues of the corresponding volume
All articles of the corresponding issues
12 results found
| no | title | author | magazine | year | volume | issue | page(s) | type |
| 1 | An efficient reconstruction of a graph from its line graph in parallel |
Naor, Joseph |
1990 |
11 | 1 |
p. 132-143 12 p. |
article |
|
| 2 | A new algorithm for the generation of binary de Bruijn sequences |
Huang, Yuejiang |
1990 |
11 | 1 |
p. 44-51 8 p. |
article |
|
| 3 | Calculating the 2-variable polynomial for knots presented as closed braids |
Morton, H.R |
1990 |
11 | 1 |
p. 117-131 15 p. |
article |
|
| 4 | Editorial Board |
1990 |
11 | 1 |
p. i- 1 p. |
article |
||
| 5 | Generating binary trees by transpositions |
Ruskey, Frank |
1990 |
11 | 1 |
p. 68-84 17 p. |
article |
|
| 6 | Improved edge-coloring algorithms for planar graphs |
Chrobak, Marek |
1990 |
11 | 1 |
p. 102-116 15 p. |
article |
|
| 7 | Papers to appear in forthcoming issues |
1990 |
11 | 1 |
p. 152- 1 p. |
article |
||
| 8 | Probability-based game tree pruning |
Li, Liwu |
1990 |
11 | 1 |
p. 27-43 17 p. |
article |
|
| 9 | Recognizing visibility graphs of spiral polygons |
Everett, H |
1990 |
11 | 1 |
p. 1-26 26 p. |
article |
|
| 10 | Sequence comparison with mixed convex and concave costs |
Eppstein, David |
1990 |
11 | 1 |
p. 85-101 17 p. |
article |
|
| 11 | The NP-completeness column: An ongoing guide |
Johnson, David S |
1990 |
11 | 1 |
p. 144-151 8 p. |
article |
|
| 12 | Uniform generation of random regular graphs of moderate degree |
McKay, Brendan D |
1990 |
11 | 1 |
p. 52-67 16 p. |
article |
12 results found