Parcourir par

  • Revues
  • Séminaires
  • Livres
  • Congrès
  • Sources

Geodesic


    Parcourir par

    • Revues
    • Séminaires
    • Livres
    • Congrès
    • Sources
Diskretnyj analiz i issledovanie operacij
Tome 5 (1998)
no. 3
Précédent Suivant

Sommaire


Locally bounded hereditary subclasses of k-colorable graphs
I. É. Zverovich
p. 3-16

Problems in scheduling theory on a~single machine with job durations proportional to an arbitrary function
A. V. Kononov
p. 17-37

Upper bounds for the complexity of symbol sequences generated by symmetric Boolean functions
Yu. V. Merekin
p. 38-43

Minimal self-correcting schemes for a sequence of Boolean functions
N. P. Red'kin
p. 44-63

On the problem of the maximum spanning tree of bounded radius
A. I. Serdyukov
p. 64-69

Search costs and interval graphs
F. V. Fomin
p. 70-79

Self-correcting schemes that realize ``narrow'' systems of linear Boolean functions
A. V. Chashkin
p. 80-95
  • À propos
  • Mentions légales
  • Politique de confidentialité