✦ LIBER ✦

On constructing multiple spanning trees in a hypercube

✍ Scribed by Feng-Hsu Wang; Ferng-Ching Lin

Publisher: Elsevier Science
Year: 1993
Tongue: English
Weight: 627 KB
Volume: 45
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(93)90116-q

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A self-stabilizing algorithm for constru

A self-stabilizing algorithm for constructing spanning trees

✍ Nian-Shing Chen; Hwey-Pyng Yu; Shing-Tsaan Huang 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 663 KB

A parallel algorithm for constructing mi

A parallel algorithm for constructing minimum spanning trees

✍ Jon Louis Bentley 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 521 KB

A divisive scheme for constructing minim

A divisive scheme for constructing minimal spanning trees in coordinate space

✍ Sabyasachy Choudhury; M.Narasimha Murty 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 322 KB

Spanning trees in a cactus

✍ Y. Egawa; Preben Dahl Vestergaard 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 361 KB

A note on bisecting minimum spanning tre

A note on bisecting minimum spanning trees

✍ W. M. Boyce; M. R. Garey; D. S. Johnson 📂 Article 📅 1978 🏛 John Wiley and Sons 🌐 English ⚖ 281 KB

A Property on Edge-disjoint Spanning Tre

A Property on Edge-disjoint Spanning Trees

✍ Hong-Jian Lai; Hongyuan Lai; Charles Payan 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 214 KB

Let G be a simple graph with n vertices and let G c denote the complement of G . Let ( G ) denote the number of components of G and G ( E ) the spanning subgraph of G with edge set E . where the minimum is taken over all such partitions . In [ Europ . J . Combin . 7 (1986) , 263 -270] , Payan conj