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 2 (1995)
no. 4
Précédent Suivant

Sommaire


Distributive coloring of graph vertices
V. G. Vizing
p. 3-12

Efficient algorithms for solving a~multistage facility location problem on a~path
E. Kh. Gimadi
p. 13-31

Lower bounds in the problem of the choice of composition of machinery in a~two-level system
Yu. A. Kochetov ; M. G. Pashchenko
p. 32-41

On regular graphs in which each edge lies in the largest number of triangles
A. A. Makhnev
p. 42-53

On the comparison of the complexities of binary k-programs
E. A. Okolnishnikova
p. 54-73

Some problems for optimizing the routing of messages in a~local communication network
A. V. Pyatkin
p. 74-79

On some estimates for the weight of l-balanced Boolean functions
Yu. V. Tarannikov
p. 80-96

New books for discrete mathematics
A. D. Korshunov
p. 97-99
  • À propos
  • Contact
  • Mentions légales
  • Politique de confidentialité