2015
DOI: 10.15587/1729-4061.2015.56247
|View full text |Cite
|
Sign up to set email alerts
|

Monitoring distributed computing systems on the basis of the determined shortest paths and shortest hamiltonian cycles in a graph

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
2
0

Year Published

2017
2017
2021
2021

Publication Types

Select...
3

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(2 citation statements)
references
References 13 publications
0
2
0
Order By: Relevance
“…The development of the distributed computing system monitoring method based on the definition of the shortest paths and the shortest Hamiltonian cycles in a graph is analyzed in the paper [4]. The model of the systems under discussion is equivalent to formal definitions of sparse graphs.…”
Section: Literature Review and Problem Statementmentioning
confidence: 99%
See 1 more Smart Citation
“…The development of the distributed computing system monitoring method based on the definition of the shortest paths and the shortest Hamiltonian cycles in a graph is analyzed in the paper [4]. The model of the systems under discussion is equivalent to formal definitions of sparse graphs.…”
Section: Literature Review and Problem Statementmentioning
confidence: 99%
“…It should be noted that because of the known connection of the clique problem with the problems of maximum independent set and minimum vertex cover [7], procedure A may be also used for solving those problems [4,14].…”
mentioning
confidence: 99%