๐”– Bobbio Scriptorium
โœฆ   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

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

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