Discrete Mathematics & Theoretical Computer Science, Volume 2

Volume 2, Number 1, 1998

• Christopher Lynch, Polina Strogova:
  SOUR graphs for efficient completion. 1-25
  Electronic Edition (link) BibTeX
• Philippe Duchon:
  Right-cancellability of a family of operations on binary trees. 27-33
  Electronic Edition (link) BibTeX
• Giovanni Manzini:
  Lower bounds for sparse matrix vector multiplication on hypercubic networks. 35-47
  Electronic Edition (link) BibTeX
• I. Dutour, Jean-Marc Fedou:
  Object grammars and random generation. 47-61
  Electronic Edition (link) BibTeX