The computer code developed previously (K. Balasubramanian, J . Computational Chern., 5,387 (1984)) for the characteristic polynomials of ordinary (nonweighted) graphs is extended in this investigation to edge-weighted graphs, heterographs (vertex-weighted), graphs with loops, directed graphs, and s
โฆ LIBER โฆ
Vanishing of Hochschild Cohomologies and Directed Graphs with Polynomial Weights
โ Scribed by Q. Zeng
- Publisher
- Elsevier Science
- Year
- 1993
- Tongue
- English
- Weight
- 618 KB
- Volume
- 154
- Category
- Article
- ISSN
- 0021-8693
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
Computer generation of characteristic po
โ
K. Balasubramanian
๐
Article
๐
1988
๐
John Wiley and Sons
๐
English
โ 624 KB
An algorithm of propagation in weighted
โ
Mario Eboli
๐
Article
๐
2010
๐
John Wiley and Sons
๐
English
โ 137 KB
This paper puts forward an algorithm that computes the diffusion of events and actions across networks of economic agents, an algorithm that is applicable when such networks can be represented as weighted directed graphs. The functioning of the algorithm is shown in three applications. First, the al