Kalugin, Yu. B. Min-cut algorithm for network schedule by merging the vertices = Алгоритм поиска минимального разреза сетевой модели слиянием вершин / Yu. B. Kalugin, A. Kaklauskas, Yu. N. Kazakov // Инженерно-строительный журнал, 2018. – № 4 (80) — 1 файл (1,49 Мб). — Загл. с титул. экрана. — Свободный доступ из сети Интернет (чтение, печать, копирование). — <URL:http://elib.spbstu.ru/dl/2/j18-535.pdf>. — DOI 10.18720/MCE.80.4
| Period
|
Read
|
Print
|
Copy
|
Open
|
Total
|
|
Year 2019
|
Quarter 1
|
February
|
1
|
0
|
1
|
0
|
2
|
|
March
|
10
|
0
|
8
|
0
|
18
|
|
Quarter 2
|
April
|
3
|
0
|
3
|
0
|
6
|
|
May
|
3
|
0
|
2
|
0
|
5
|
|
June
|
6
|
0
|
7
|
0
|
13
|
|
Quarter 3
|
July
|
4
|
0
|
5
|
0
|
9
|
|
August
|
2
|
0
|
4
|
0
|
6
|
|
September
|
1
|
0
|
3
|
0
|
4
|
|
Quarter 4
|
October
|
2
|
0
|
2
|
0
|
4
|
|
November
|
2
|
0
|
1
|
0
|
3
|
|
December
|
1
|
0
|
4
|
0
|
5
|
|
Year 2020
|
Quarter 1
|
January
|
1
|
0
|
2
|
0
|
3
|
|
February
|
1
|
0
|
7
|
0
|
8
|
|
March
|
5
|
0
|
1
|
0
|
6
|
|
Quarter 2
|
April
|
6
|
0
|
0
|
0
|
6
|
|
May
|
1
|
0
|
0
|
0
|
1
|
|
June
|
3
|
0
|
0
|
0
|
3
|
|
Quarter 3
|
July
|
2
|
0
|
0
|
0
|
2
|
|
Total
|
54
|
0
|
50
|
0
|
104
|
