From Hall's matching theorem to optimal routing on hypercubes

DOI10.1006/jctb.1998.1850zbMath1022.68132OpenAlexW2063916905MaRDI QIDQ1569034

Beth Novick, Shuhong Gao, Ke Qiu

Publication date: 25 June 2000

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/d6d930dee358bd38ec945d0af640f727583a5d57

zbMATH Keywords

network routingdisjoint ordering

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Permutations, words, matrices (05A05) Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10)

Related Items (6)

One-to-many node-disjoint paths of hyper-star networks ⋮ One-to-many node-disjoint paths in \((n,k)\)-star graphs ⋮ Complexity of pairwise shortest path routing in the grid ⋮ Short containers in Cayley graphs ⋮ Two conditions for reducing the maximal length of node-disjoint paths in hypercubes ⋮ Strong Rabin numbers of folded hypercubes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Efficient algorithms for finding maximum matching in graphs
• Efficient dispersal of information for security, load balancing, and fault tolerance
• On Representatives of Subsets

This page was built for publication: From Hall's matching theorem to optimal routing on hypercubes