Publisher: Elsevier

Related content
Volume 57, Number 4, 26 February 1996

< previous issue | all issues | next issue >

Favourites:Add to Favourites

Medians and centres of polyominoes
pp. 175-181(7)
Authors: Metivier, Y.; Saheb, N.

Favourites:Add to Favourites

Shortest routing in trivalent Cayley graph network
pp. 183-188(6)
Authors: Vadapalli, P.; Srimani, P.K.

Favourites:Add to Favourites

On the sample complexity of noise-tolerant learning
pp. 189-195(7)
Authors: Aslam, J.A.; decatur, S.E.

Favourites:Add to Favourites

A simple linear-time algorithm for finding path-decompositions of small width
pp. 197-203(7)
Authors: Cattell, K.; Dinneen, M.J.; Fellows, M.R.

Favourites:Add to Favourites

Seek distances in two-headed disk systems
pp. 205-209(5)
Authors: Murshed, M.M.; Kaykobad, M.

Favourites:Add to Favourites

A characterization of the information content of a classification
pp. 211-214(4)
Authors: Baclawski, K.; Simovici, D.A.

Favourites:Add to Favourites

Routing on trees
pp. 215-223(9)
Author: Symvonis, A.

Favourites:Add to Favourites

On the number of edges in cycletrees
pp. 225-229(5)
Authors: Veanes, M.; Barklund, J.

Share Content

Access Key

Free Content
Free content
New Content
New content
Open Access Content
Open access content
Subscribed Content
Subscribed content
Free Trial Content
Free trial content
Cookie Policy
X
Cookie Policy
ingentaconnect website makes use of cookies so as to keep track of data that you have filled in. I am Happy with this Find out more