✦ LIBER ✦

Rank and statistical mapping of a strongly connected automaton

✍ Scribed by A. S. Barashko

Publisher: Springer US
Year: 1988
Tongue: English
Weight: 541 KB
Volume: 23
Category: Article
ISSN: 1573-8337
DOI: 10.1007/bf01078908

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The semigroup of a strongly connected au

The semigroup of a strongly connected automaton

✍ Robert H. Oehmke 📂 Article 📅 1977 🏛 Springer 🌐 English ⚖ 291 KB

Some results on the set of congruence re

Some results on the set of congruence relations in a finite, strongly connected automaton

✍ P. Deussen 📂 Article 📅 1967 🏛 Springer Vienna 🌐 English ⚖ 714 KB

S-continuous mappings, certain weak form

S-continuous mappings, certain weak forms of normality and strongly semilocally connected spaces

✍ J. K. Kohli 📂 Article 📅 1980 🏛 John Wiley and Sons 🌐 English ⚖ 496 KB

A representation of strongly connected a

A representation of strongly connected automata and its applications

✍ Masami Ito 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 993 KB

Correlations and scaling in the outflow

Correlations and scaling in the outflow statistics of a sandpile automaton

✍ S.S. Manna; János Kertész 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 732 KB

The w-median of a connected strongly cho

The w-median of a connected strongly chordal graph

✍ Hai-Yen Lee; Gerard J. Chang 📂 Article 📅 1994 🏛 John Wiley and Sons 🌐 English ⚖ 337 KB 👁 1 views

## Abstract Suppose __G = (V, E)__ is a graph in which every vertex __x__ has a non‐negative real number __w(x)__ as its weight. The __w__‐distance sum of a vertex __y__ is __D~G, w~(y)__ = σ~x≅v~ __d(y, x)w(x).__ The __w__‐median of __G__ is the set of all vertices __y__ with minimum __w__‐distanc