Digital Library
Close Browse articles from a journal
     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 Author index 1996
64 3 p. 293-294
2 p.
article
2 Book announcements 1996
64 3 p. 289-291
3 p.
article
3 Design of a d-connected digraph with a minimum number of edges and a quasiminimal diameter: II Soneoka, Terunao
1996
64 3 p. 267-279
13 p.
article
4 Diameter-vulnerability of large bipartite digraphs Padró, C.
1996
64 3 p. 239-248
10 p.
article
5 Finding Hamiltonian cycles in Delaunay triangulations is NP-complete Dillencourt, Michael B.
1996
64 3 p. 207-217
11 p.
article
6 Optimal parallel algorithm for Brooks' colouring bounded degree graphs in logarithmic time on EREW PRAM Sajith, G.
1996
64 3 p. 249-265
17 p.
article
7 Short disjoint cycles in graphs with degree constraints Brandstädt, Andreas
1996
64 3 p. 197-205
9 p.
article
8 The basic cyclic scheduling problem with linear precedence constraints Munier, A.
1996
64 3 p. 219-238
20 p.
article
9 Triangulating graphs without asteroidal triples Möhring, Rolf H.
1996
64 3 p. 281-287
7 p.
article
                             9 results found
 
 Koninklijke Bibliotheek - National Library of the Netherlands