✦ LIBER ✦

Edge-disjoint spanning trees and depth-first search

✍ Scribed by Robert Endre Tarjan

Publisher: Springer-Verlag
Year: 1976
Tongue: English
Weight: 707 KB
Volume: 6
Category: Article
ISSN: 0001-5903
DOI: 10.1007/bf00268499

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Edge-disjoint spanning trees: A connecte

Edge-disjoint spanning trees: A connectedness theorem

✍ M. Farber; B. Richter; H. Shank 📂 Article 📅 1985 🏛 John Wiley and Sons 🌐 English ⚖ 268 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

Edge disjoint spanning trees in random g

Edge disjoint spanning trees in random graphs

✍ A. M. Frieze; T. Łuczak 📂 Article 📅 1990 🏛 Springer Netherlands 🌐 English ⚖ 145 KB

Multicast in Wormhole-Switched Torus Net

Multicast in Wormhole-Switched Torus Networks Using Edge-Disjoint Spanning Trees

✍ Honge Wang; Douglas M. Blough 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 486 KB

A tree-based multicast algorithm for wormhole-switched networks which makes use of multiple edge-disjoint spanning trees is presented. The disjoint spanning-tree multicast, or DSTM, algorithm provides deadlock-free multicast routing that is fully compatible with unicast. The application of the DSTM

Embedding k(n−k) edge-disjoint spanning

Embedding k(n−k) edge-disjoint spanning trees in arrangement graphs

✍ Chin-Tsai Lin 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 278 KB

The arrangement graphs are a class of generalized star graphs. In this paper we construct a graph that consists of the maximum number of directed edge-disjoint spanning trees in an arrangement graph. The paths that connect the common root node to any given node through different spanning trees are n

Depth-first iterative-deepening: An opti

Depth-first iterative-deepening: An optimal admissible tree search

✍ Richard E. Korf 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 686 KB

The complexities of various search algorithms are considered in terms of time, space, and cost of solution path. It is known that breadth-first search requires too much space and depth-first search can use too much time and doesn't always find a cheapest path. A depth-first iterative-deepening algor