Geodesic

Volume 28 (2021) no. 1

Table of contents

Backtracking algorithms for constructing the Hamiltonian decomposition of a $4$-regular multigraph
p. 6-21
NP-completeness of the minimum spanning tree problem of a multiple graph of multiplicity $k \geqslant 3$
p. 22-37
On characteristics of symbolic execution in the problem of assessing the quality of obfuscating transformations
p. 38-51
Online testing of dynamic reconfigurations w.r.t. adaptation policies
p. 52-73
An algorithm for correcting levels of useful signals on interpretation of eddy-current defectograms
p. 74-88
Automated teaching system “Sets” (research for organizing the 1st part of the project)
p. 90-103
LTL-specification of counter machines
p. 104-119