| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
A labeling algorithm to recognize a line digraph and output its root graph
|
Syslo, Maciej M.
|
|
1982
|
15 |
1 |
p. 28-30
3 p.
|
artikel
|
| 2 |
A linear algorithm to determine minimal spanning forests in chain graphs
|
Luccio, F.
|
|
1982
|
15 |
1 |
p. 1-4
4 p.
|
artikel
|
| 3 |
A memory-management unit for the optimal exploitation of a small address space
|
Bron, C.
|
|
1982
|
15 |
1 |
p. 20-22
3 p.
|
artikel
|
| 4 |
An improved list-searching algorithm
|
Levy, Leon S.
|
|
1982
|
15 |
1 |
p. 43-45
3 p.
|
artikel
|
| 5 |
A note on some tree similarity measures
|
Culik II, Karel
|
|
1982
|
15 |
1 |
p. 39-42
4 p.
|
artikel
|
| 6 |
A note on two-way nondeterministic pushdown automata
|
Rytter, Wojciech
|
|
1982
|
15 |
1 |
p. 5-9
5 p.
|
artikel
|
| 7 |
Editorial Board
|
|
|
1982
|
15 |
1 |
p. ii-
1 p.
|
artikel
|
| 8 |
Efficient parallel algorithms for linear recurrence computation
|
Greenberg, Albert C.
|
|
1982
|
15 |
1 |
p. 31-35
5 p.
|
artikel
|
| 9 |
NP-completeness of some generalizations of the maximum matching problem
|
Stockmeyer, Larry J.
|
|
1982
|
15 |
1 |
p. 14-19
6 p.
|
artikel
|
| 10 |
On computability of the mean deviation
|
Winkler, Peter M.
|
|
1982
|
15 |
1 |
p. 36-38
3 p.
|
artikel
|
| 11 |
Optimal database reorganisation: some practical difficulties
|
Leung, C.H.C.
|
|
1982
|
15 |
1 |
p. 23-27
5 p.
|
artikel
|
| 12 |
Tables of large graphs wh given degree and diameter
|
Bermond, J.-C.
|
|
1982
|
15 |
1 |
p. 10-13
4 p.
|
artikel
|
Tijdschrift beschrijving