✦ LIBER ✦

Properties of the k-centra in a tree network

✍ Scribed by G. Andreatta; F. M. Mason

Publisher: John Wiley and Sons
Year: 1985
Tongue: English
Weight: 182 KB
Volume: 15
Category: Article
ISSN: 0028-3045
DOI: 10.1002/net.3230150103

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A tree-network has the fixed point prope

A tree-network has the fixed point property

✍ Martine Labbé; Jacques-François Thisse 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 196 KB

Efficient algorithms for finding the (k,

Efficient algorithms for finding the (k, l)-core of tree networks

✍ Ronald I. Becker; Isabella Lari; Giovanni Storchi; Andrea Scozzari 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 131 KB

On enumerating the trees of a ladder net

On enumerating the trees of a ladder network

✍ D. E. Johnson; J. R. Johnson 📂 Article 📅 1973 🏛 John Wiley and Sons 🌐 English ⚖ 307 KB

Decomposition algorithms for the design

Decomposition algorithms for the design of a nonsimultaneous capacitated evacuation tree network

✍ April K. Andreas; J. Cole Smith 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 225 KB

Efficient Parallel Algorithms for Optima

Efficient Parallel Algorithms for Optimally Locating a Path and a Tree of a Specified Length in a Weighted Tree Network

✍ Biing-Feng Wang 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 128 KB

In this paper, we propose efficient parallel algorithms on the EREW PRAM for optimally locating in a tree network a path-shaped facility and a tree-shaped facility of a specified length. Edges in the tree network have arbitrary positive lengths. Two optimization criteria are considered: minimum ecce

The number of spanning trees in a class

The number of spanning trees in a class of double fixed-step loop networks

✍ Xuerong Yong; Yuanping Zhang; Mordecai J. Golin 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 140 KB