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

Some Decision Problems Associated with Weighted, Directed Graphs

โœ Scribed by Deuel, D. R.; Gill, A.

Book ID
118192413
Publisher
Society for Industrial and Applied Mathematics
Year
1966
Tongue
English
Weight
790 KB
Volume
14
Category
Article
ISSN
0036-1399

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Edge Weight Reduction Problems in Direct
Edge Weight Reduction Problems in Directed Acyclic Graphs
โœ Susanne E. Hambrusch; Hung-Yi Tu ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 378 KB

Let G be a weighted directed acyclic graph in which edge weights are not static quantities, but can be reduced for a certain cost. In this paper we consider the problem of determining which edges to reduce so that the length of the longest paths is minimized and the total cost associated with the re

Minimal sense of direction and decision
Minimal sense of direction and decision problems for Cayley graphs
โœ Paolo Boldi; Sebastiano Vigna ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 430 KB

Sense of direction is a property of the labelling of (possibly anonymous) networks which allows to assign coherently local identifiers to other processors on the basis of the route followed by incoming messages. A graph has minimal sense of direction whenever it has sense of direction and the number

Spectral characterization of some weight
Spectral characterization of some weighted rooted graphs with cliques
โœ Oscar Rojo; Luis Medina ๐Ÿ“‚ Article ๐Ÿ“… 2010 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 349 KB

The level of a vertex in a rooted graph is one more than its distance from the root vertex. A generalized Bethe tree is a rooted tree in which vertices at the same level have the same degree. We characterize completely the eigenvalues of the Laplacian, signless Laplacian and adjacency matrices of a