✦ LIBER ✦

Using local adaptations to reconfigure a spanning tree of a network

✍ Scribed by Kirk R. Pruhs

Book ID: 104183059
Publisher: Elsevier Science
Year: 1995
Tongue: English
Weight: 535 KB
Volume: 57
Category: Article
ISSN: 0166-218X
DOI: 10.1016/0166-218x(94)00077-q

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Bicriteria network design using a spanni

Bicriteria network design using a spanning tree-based genetic algorithm

✍ J. R. Kim; M. Gen; K. Ida 📂 Article 📅 1999 🏛 Springer Japan 🌐 English ⚖ 730 KB

Widening the dynamic range of pictures u

Widening the dynamic range of pictures using a minimum spanning tree algorithm

✍ Orly Yadid-Pecht 📂 Article 📅 2000 🏛 Springer-Verlag 🌐 English ⚖ 106 KB

A petri net approach to determine all sp

A petri net approach to determine all spanning trees for overall reliability analysis of general networks

✍ Vinod Kumar; K.K. Aggarwal 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 361 KB

Petri Nets ( PNs) form a very useful model for procedures, organization and devices where information flows play an important role. They can represent the system at different levels of abstraction ranging from a single bit in a computer memory to the embedding of a computer system into its environme

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

Using the Miller-Tucker-Zemlin constrain

Using the Miller-Tucker-Zemlin constraints to formulate a minimal spanning tree problem with hop constraints

✍ Luis Gouveia 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 871 KB

Counting the number of spanning trees in

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

✍ Talip Atajan; Naohisa Otsuka; Xuerong Yong 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 495 KB

A double fixed-step loop network, C p,q n , is a digraph on n vertices 0, 1, 2, . . . , n -1 and for each vertex i (0 < i ≤ n-1), there are exactly two arcs going from vertex i to vertices i+p, i + q (mod n). Let p < q < n be positive integers such that (qp) Ď n and (qp)|(k 0 np) or (qp)|n (where k