From Hall's matching theorem to optimal routing on hypercubes
type: Item
instance of: scholarly article
title: From Hall's matching theorem to optimal routing on hypercubes
zbMATH Open document ID: 1022.68132
author: Shuhong Gao
author: Beth Novick
author: Ke Qiu
published in: Journal of Combinatorial Theory. Series B
publication date: 2000-06-25T00:00:00Z
Mathematics Subject Classification ID: 68W10
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05A05
Mathematics Subject Classification ID: 68M10
zbMATH DE Number: 1464265
zbMATH Keywords: disjoint ordering
zbMATH Keywords: network routing
MaRDI profile type: Publication
OpenAlex ID: W2063916905
cites work: Q5422499
cites work: Efficient algorithms for finding maximum matching in graphs
cites work: On Representatives of Subsets
cites work: Q4002466
cites work: Q4393297
cites work: Efficient dispersal of information for security, load balancing, and fault tolerance
DOI: 10.1006/JCTB.1998.1850
description: scientific article; zbMATH DE number 1464265