Pages that link to "Item:Q4286237"
From MaRDI portal
The following pages link to Broadcasting and Gossiping in de Bruijn Networks (Q4286237):
Displaying 22 items.
- Containment of butterflies in networks constructed by the line digraph operation (Q290188) (← links)
- On edge-disjoint spanning trees with small depths (Q294801) (← links)
- Data center interconnection networks are not hyperbolic (Q301597) (← links)
- Spanning trees: A survey (Q659663) (← links)
- Communication complexity of fault-tolerant information diffusion (Q1274923) (← links)
- Methods and problems of communication in usual networks (Q1339884) (← links)
- Embedding de Bruijn, Kautz and shuffle-exchange networks in books (Q1377659) (← links)
- Broadcasting and gossiping on de Bruijn, shuffle-exchange and similar networks (Q1392538) (← links)
- Uniform homomorphisms of de Bruijn and Kautz networks (Q1392540) (← links)
- Factorization of de Bruijn digraphs by cycle-rooted trees (Q1603418) (← links)
- Faster gossiping on butterfly networks (Q1770425) (← links)
- D2B: A de Bruijn based content-addressable network (Q2368967) (← links)
- Matching preclusion and conditional edge-fault Hamiltonicity of binary de Bruijn graphs (Q2410255) (← links)
- Miscellaneous Digraph Classes (Q3120443) (← links)
- Shortest path routing and fault-tolerant routing on de Bruijn networks (Q4488861) (← links)
- (Q4808640) (← links)
- (Q4870160) (← links)
- Transmitting on various network topologies (Q4887744) (← links)
- Analyzing network coding gossip made easy (Q5419099) (← links)
- Algorithms - ESA 2003 (Q5897261) (← links)
- Independent spanning trees with small depths in iterated line digraphs (Q5936460) (← links)
- A broadcasting protocol in line digraphs (Q5949492) (← links)
