# [PDF] Top 20 On the Independent Spanning Trees Problem in a Hypercube

Has 10000 "On the Independent Spanning Trees Problem in a Hypercube" found on our website. Below are the top 20 most common "On the Independent Spanning Trees Problem in a Hypercube".

### On the Independent Spanning Trees Problem in a Hypercube

... broadcasting **in** **a** **hypercube**. Based **on** their algorithm, **the** source node sends **the** message to all its neighbors at ...Then, **the** neighbors **in** turn send **the** ... See full document

4

### Reducing the height of independent spanning trees in chordal rings

... with **a** particular family of regular 4-connected graphs, called chordal ...are **a** variation of ring ...vertex **in** **a** ring network, **the** reliability and fault-tolerance of **the** network ... See full document

6

### On the height of independent spanning trees of a k-connected k-regular graph

... SDWK LQ HDFK WUHH DUH LQWHUQDOO\ GLVMRLQW $ VHW RI VSDQQLQJ WUHHV RI * LV VDLG WR EH LQGHSHQGHQW LI WKH\ DUH SDLUZLVH LQGHSHQGHQW =HKDYL DQG ,WDL FRQMHFWXUHG WKDW DQ\ NFRQQHFWHG JUDSK KD[r] ... See full document

6

### Constructing independent spanning trees for locally twisted cubes

... consider **the** ISTs **problem** **on** **the** n-dimensional locally twisted cube LTQ n .... **The** very recent algorithm proposed by Hsieh and Tu [12] is designed to construct n edge-ISTs rooted at ... See full document

16

### A note on optimal communication spanning trees

... note **on** optimal communication **spanning** **trees** Bang Ye Wu Kun–Mao Chao April 1, 2004 **The** optimal communication **spanning** tree (OCT) **problem** is defined as ...given **the** ... See full document

4

### Edge-disjoint Undirected Spanning Trees on the Wrapped Butterfly Networks

... **The** **problem** of finding **the** maximum number of edge- disjoint **spanning** **trees** arises from **the** need for developing efficient collective communication algorithms **in** distributed ... See full document

6

### Embedding Edge-Disjoint Spanning Trees on the Alternating Group Graphs

... from **the** minimum possible depth by **a** small constant. **The** root node of EDSTs has 2(n-2) node-disjoint paths to each one of **the** other nodes, one path through each of **the** 2(n-2) ... See full document

21

### On k-ary spanning trees of tournaments

... contains **a** Hamiltonian path, which can be restated as that every tournament contains **a** unary **spanning** ...tree. **The** purpose of this article is to study **the** general **problem** of ... See full document

10

### Counting Spanning Trees

... create **a** sparse subgraph that reflects **a** lot about **the** original ...role **in** designing efficient routing ...as **the** Steiner tree **problem** and **the** traveling salesperson ... See full document

6

### Minimum Spanning Trees

... minimum **spanning** tree **problem** is always included **in** algorithm textbooks since (1) it arises **in** many applications, (2) it is an important example where greedy algorithms always deliver an ... See full document

11

### Spanning Trees and Optimization Problems (Excerpt)-Chapter 2 Minimum Spanning Trees

... describes **the** history of **the** **problem** up to 1985. **The** earliest known MST algorithm was proposed by Otakar Bor˚ uvka [1], **a** great Czech mathematician, **in** ...occupies **the** ... See full document

12

### On minimal cost-reliability ratio spanning trees and related problems

... The MCRRST problem is a specific version of the following generalized problem discussed in Hassin and Tamir [5].. Previous work.[r] ... See full document

5

### An optimal algorithm for finding locally connected spanning trees on circular-arc graphs

... ﬁned **on** general graphs, and solvable **in** O( |V (G)|+ |E(G)|) time if they are deﬁned **on** circular-arc ...whether **the** LCST **problem** is NP-complete or polynomial time solvable when it is ... See full document

9

### THE MOST VITAL EDGES WITH RESPECT TO THE NUMBER OF SPANNING-TREES IN 2-TERMINAL SERIES-PARALLEL GRAPHS

... In this paper, both the 1-MVE problem and k-MVE problem are considered for a special class of graphs called two-terminal series-parallel graphs [5], The formal description of t[r] ... See full document

10

### Locally connected spanning trees in strongly chordal graphs and proper circular-arc graphs

... All **the** schemes above require speed measurement. However, **the** speed measuring device is rather costly relative to **the** price of an induction motor **in** ...Besides, **the** measured signals are ... See full document

32

### Spanning Trees and Optimization Problems (Excerpt)-Chapter 3 Shortest-Paths Trees

... Reading **The** shortest-paths tree **problem** is one of **the** most classical network flow optimization ...equivalent **problem** is to find **a** shortest path from **a** given source vertex s ∈ V ... See full document

16

### On constructing multiple spanning trees in a hypercube

... Keywords: Distributed data structure; communication tree; inorder spanning tree; edge congestion; node congestion; fault tolerance1. Introduction.[r] ... See full document

7

### Independent Spanning Trees on Recursive Circulant Graphs

... ,QGHSHQGHQW 6SDQQLQJ 7UHHV RQ 5HFXUVLYH &LUFXODQW *UDSKV... DQG LQGXFH DQ.[r] ... See full document

8

### On the spanning connectivity and spanning laceability of hypercube-like networks

... 1.3. **Hypercube**-like graphs H n 0 Graph containers do exist **in** engineering design information and telecommunication networks or **in** biological and neural systems ([2,12] and its ...references). ... See full document

12

### The spanning laceability on the faulty bipartite hypercube-like networks

... notations **The** research about interconnection networks is important for parallel and distributed computer ...systems. **The** layouts of processors and links **in** distributed computer systems are usually ... See full document

9

相關主題