Monitoring of dynamically changed graph
Monitoring of oriented graphs is a key task in many applications. Such monitoring is very specific when the graph models a communication network including Internet and GRID. A node of the network has local information about the network: if "knows" only about the arcs outgoing from this nod...
Main Authors: | Igor Burdonov, Alexander Kosachev |
---|---|
Format: | Article |
Language: | English |
Published: |
Ivannikov Institute for System Programming of the Russian Academy of Sciences
2018-10-01
|
Series: | Труды Института системного программирования РАН |
Subjects: | |
Online Access: | https://ispranproceedings.elpub.ru/jour/article/view/577 |
Similar Items
-
Graph learning by a set of automata
by: Igor Burdonov, et al.
Published: (2018-10-01) -
Testing of automata system
by: I. B. Burdonov, et al.
Published: (2018-10-01) -
Automata system: determinism conditions and testing
by: Igor Burdonov, et al.
Published: (2018-10-01) -
Automata system: composition according to graph of links
by: I. B. Burdonov, et al.
Published: (2018-10-01) -
COMPARATIVE ANALYSIS OF COLORING ALGORITHMS FOR ORDINARY WEIGHTED GRAPH
by: Andrey Sergeyevich Merzlenko, et al.
Published: (2014-06-01)