Large-scale network analysis with applications to transportation, communication and inference networks
type: Item
instance of: scholarly article
title: Large-scale network analysis with applications to transportation, communication and inference networks
zbMATH Open document ID: 0667.90095
DOI: 10.1016/0012-365X(88)90225-7
author: Hoon Heng Teh
author: Meng Fang Foo
published in: Discrete Mathematics
publication date: 1988-01-01T00:00:00Z
review text: The study of large-scale networks has been mainly motivated by practical problems, like transportation and reliability problems. The problems usually involve finding optimal paths in networks and they are rather similar in nature. These different networks can be unified into a more general form of network, the semiring network. Attempts to describe such networks in a general setting is not new. \textit{D. R. Shier} [Iterative algorithms for calculating network reliability, Graph Theor. Appl. Algorithms Comput. Science, 741-752 (1975)] has described an algebraic structure to study reliability problem. \textit{B. A. Carré} [J. Inst. Math. Appl. 7, 273-294 (1971; Zbl 0219.90020)] has given an excellent description of semiring networks and their properties using matrices. In this paper, we shall describe semiring networks and show how to deal with large matrices. The latter is particularly important because in large- scale networks, even computation on the computer presents some difficulties as the amount of random access memory in every computer is limited and the computation time may be long.
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 05C25
Mathematics Subject Classification ID: 90B05
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 15A99
Mathematics Subject Classification ID: 94C15
Mathematics Subject Classification ID: 94A05
zbMATH DE Number: 4093205
zbMATH Keywords: communication
zbMATH Keywords: inference
zbMATH Keywords: transportation
zbMATH Keywords: reliability
zbMATH Keywords: optimal paths
zbMATH Keywords: semiring network
zbMATH Keywords: large matrices
zbMATH Keywords: large-scale networks
describes a project that uses: Algorithm 97
MaRDI profile type: Publication
cites work: Q3219752
cites work: Q3048571
cites work: Q3863425
cites work: Q5675559
cites work: An Algebra for Network Routing Problems
cites work: The Cascade Algorithm for Finding all Shortest Distances in a Directed Graph
cites work: Revised Matrix Algorithms for Shortest Paths
cites work: A Decomposition Algorithm for Shortest Paths in a Network
cites work: A Decomposition Algorithm for the Shortest-Route Problem
cites work: Matrix operations and the properties of networks and directed graphs
description: scientific article; zbMATH DE number 4093205