Browse by

  • Collections
  • Sources

Geodesic


    Browse by

    • Collections
    • Sources
Diskretnyj analiz i issledovanie operacij
Volume 25 (2018)
no. 2
Previous Next

Volume 25 (2018) no. 2

Table of contents


New cases of the polynomial solvability of the independent set problem for graphs with forbidden paths
V. E. Alekseev; S. V. Sorochan
p. 5-18

Word-representable graphs: a survey
s. V. Kitaev; A. V. Pyatkin
p. 19-53

On a partial order related to divisibility
V. K. Leontiev
p. 54-61

Complete fault detection tests of length 2 for logic networks under stuck-at faults of gates
K. A. Popkov
p. 62-81

Complexity estimation for an algorithm of searching for zero of a piecewise linear convex function
E. V. Prosolupov; G. Sh. Tamasyan
p. 82-100

On trees of bounded degree with maximal number of greatest independent sets
D. S. Taletskii; D. S. Malyshev
p. 101-123

Semigroup and metric characteristics of locally primitive matrices and graphs
V. M. Fomichev
p. 124-143
  • About
  • Contact
  • Legal notice
  • Privacy policy