Digital Library
Close Browse articles from a journal
 
Search for with title:
ABCDEFGHIJKLMNOPQRSTUVWXYZ

     Journal description
       All volumes of the corresponding journal
         All issues of the corresponding volume
                                       All articles of the corresponding issues
 
                             9 results found
no title author magazine year volume issue page(s) type
1 A complete decoding algorithm for double-error-correcting primitive binary BCH codes of odd m Lu, Erl-Huei
 1994
 51 3 p. 117-120
4 p.
 article
2 A linear algorithm for centering a spanning tree of a biconnected graph Easwarakumar, K.S.
 1994
 51 3 p. 121-124
4 p.
 article
3 Approximations for the maximum acyclic subgraph problem Hassin, Refael
 1994
 51 3 p. 133-140
8 p.
 article
4 Counting trees in a graph is #P-complete Jerrum, Mark
 1994
 51 3 p. 111-116
6 p.
 article
5 Enumerating the kernels of a directed graph with no odd circuits Szwarcfiter, Jayme L.
 1994
 51 3 p. 149-153
5 p.
 article
6 Enumeration of binary trees Bapiraju, Vinnakota
 1994
 51 3 p. 125-127
3 p.
 article
7 Internal path length of the binary representation of heap-ordered trees Chen, Wen-Chin
 1994
 51 3 p. 129-132
4 p.
 article
8 On competitive on-line algorithms for the dynamic priority-ordering problem Ramalingam, G.
 1994
 51 3 p. 155-161
7 p.
 article
9 The convex-hull-and-line traveling salesman problem: a solvable case Deineko, Vladimir G.
 1994
 51 3 p. 141-148
8 p.
 article
                             9 results found
 
 Koninklijke Bibliotheek - National Library of the Netherlands