𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Routing Flow Through a Strongly Connected Graph

✍ Scribed by T. Erlebach and T. Hagerup

Book ID
120136521
Publisher
Springer
Year
2002
Tongue
English
Weight
69 KB
Volume
32
Category
Article
ISSN
0178-4617

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A conjeccture concerning strongly connec
A conjeccture concerning strongly connected graphs
✍ Binyamin Schwarz πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 1014 KB

## In memory of my beloved wife Ruhama Let C&KY!) b< the class of all directed gra without loops zad wilhaut m~~ti~ie arcs, such that each graph G has N vertice ci arcs. A primal subgraph of G is generated by deleting one vertex and all the a ng out from this viwex or into it. We conjecture that i

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

A note on k-strongly connected orientati
A note on k-strongly connected orientations of an undirected graph
✍ AndrΓ‘s Frank πŸ“‚ Article πŸ“… 1982 πŸ› Elsevier Science 🌐 English βš– 168 KB

Each k-strongly connected orientation of an undirect:7d I.&P A \_an be obtained from any other k-strongly connected orientation by reversing consec aLir :!I 3irected paths or circuits without destroying the k-strong connectivity.