๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Graphs and networks

โœ Scribed by J.V. Oldfield

Publisher
Elsevier Science
Year
1974
Tongue
English
Weight
337 KB
Volume
6
Category
Article
ISSN
0010-4485

No coin nor oath required. For personal study only.

โœฆ Synopsis

The concepts and application of graph theory to practical problems involving networks are discussed. Examples are given from digital system design.

๐Ÿ“œ SIMILAR VOLUMES

The curl of graphs and networks
The curl of graphs and networks
โœ Karl Gustafson; Frank Harary ๐Ÿ“‚ Article ๐Ÿ“… 1985 ๐Ÿ› Elsevier Science โš– 775 KB
Connectionist networks qua graphs
Connectionist networks qua graphs
โœ D. Partridge ๐Ÿ“‚ Article ๐Ÿ“… 1988 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 521 KB

There is a lot of excitement in the field of artificial intelligence (AI) at the moment centering around the ideas of "connectionism". Connections networks are used to represent knowledge in terms of "subsymbolic" nodes (i.e. a single node does not by itself represent a conceptual entity, such as a

Balanced graphs and network flows
Balanced graphs and network flows
โœ Penrice, Stephen G. ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 64 KB

A graph G is balanced if the maximum ratio of edges to vertices, taken over all subgraphs of G, occurs at G itself. This note uses the max-flow/min-cut theorem to prove a good characterization of balanced graphs. This characterization is then applied to some results on how balanced graphs may be com