Dense Edge-Disjoint Embedding of Complete Binary Trees in Interconnection Networks

Theoretical Computer Science - Netherlands
doi 10.1016/s0304-3975(00)00066-9
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Elsevier BV

Related search

Embedding Complete Binary Trees in Product Graphs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1997English

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

Journal of Parallel and Distributed Computing
Computer NetworksHardwareCommunicationsArchitectureTheoretical Computer ScienceArtificial IntelligenceSoftware
2001English

The Complexity of Embedding Graphs Into Binary Trees

English

The Connection Patterns of Two Complete Binary Trees

SIAM Journal on Algebraic Discrete Methods
1980English

Arc-Disjoint In-Trees in Directed Graphs

Combinatorica
CombinatoricsComputational MathematicsDiscrete Mathematics
2009English

Interconnection Networks

1993English

Interconnection Networks

2008English

Embedding of Two-Colored Right-Angled Coxeter Groups Into Products of Two Binary Trees

Manuscripta Mathematica
Mathematics
2007English

Corrigendum: Edge-Disjoint Paths in Expander Graphs

SIAM Journal on Computing
MathematicsComputer Science
2001English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2026 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy