Zobrazeno 1 - 10
of 37
pro vyhledávání: '"Miro Kraetzl"'
Publikováno v:
Computers, Software Engineering, and Digital Devices ISBN: 9781315220659
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::318eb12397d5a1d1dfbafd69f56c5f65
https://doi.org/10.1201/9781315220659-17
https://doi.org/10.1201/9781315220659-17
Publikováno v:
Pattern Recognition. 39:573-586
Algorithms for the analysis of graph sequences are proposed in this paper. In particular, we study the problem of recovering missing information and predicting the occurrence of nodes and edges in time series of graphs. Two different recovery schemes
Publikováno v:
Annals of Operations Research. 134:101-118
Consider a network of unreliable links, modelling for example a communication network. Estimating the reliability of the network—expressed as the probability that certain nodes in the network are connected—is a computationally difficult task. In
Publikováno v:
Journal of Parallel and Distributed Computing. 64:1345-1359
Network behavior is the set of observations or measurements that can be made about a network over time. The growth of network-based computing and the Internet have ensured that networks can no longer be considered in isolation, as events external to
Publikováno v:
Pattern Analysis and Applications. 7:243-254
A special class of graphs is introduced in this paper. The graphs belonging to this class are characterised by the existence of unique node labels. A number of matching algorithms for graphs with unique node labels are developed. It is shown that pro
Publikováno v:
International Journal of Pattern Recognition and Artificial Intelligence. 18:425-442
A hierarchical abstraction scheme based on node contraction and two related similarity measures for graphs with unique node labels are proposed in this paper. The contraction scheme reduces the number of nodes in a graph and leads to a speed-up in th
Publikováno v:
Probability in the Engineering and Informational Sciences. 17:23-45
This article presents Monte Carlo techniques for estimating network reliability. For highly reliable networks, techniques based on graph evolution models provide very good performance. However, they are known to have significant simulation cost. An e
Publikováno v:
Journal of Interconnection Networks. :85-101
In the management of large enterprise communication networks, it becomes difficult to detect and identify causes of abnormal change in traffic distributions when the underlying logical topology is dynamic. This paper describes a novel approach to abn
Publikováno v:
Journal of Parallel and Distributed Computing. 54:77-132
We survey routing problems on fixed-connection networks. We consider many aspects of the routing problem and provide known theoretical results for various communication models. We focus on (partial) permutation, k-relation routing, routing to random
Publikováno v:
International Journal of Foundations of Computer Science. :121-137
Considering continuous routing, we analyze the transient behavior of n×n routers with input buffering, split input buffering, output buffering, and central buffering with dedicated virtual circuits, one for each source-destination pair in a network.