Many-to-many routing on trees via matchings
type: Item
instance of: scholarly article
title: Many-to-many routing on trees via matchings
zbMATH Open document ID: 0901.68019
DOI: 10.1016/S0304-3975(97)00049-2
author: Grammati Pantziou
author: Alan Roberts
author: Antonios Symvonis
published in: Theoretical Computer Science
publication date: 1998-07-22T00:00:00Z
Mathematics Subject Classification ID: 68M99
Mathematics Subject Classification ID: 68W10
zbMATH DE Number: 1177662
zbMATH Keywords: hot-potato routing
zbMATH Keywords: matching routing model
zbMATH Keywords: off-line routing
zbMATH Keywords: on-line routing
zbMATH Keywords: packet routing
MaRDI profile type: Publication
cites work: Q3805925
cites work: Routing permutations on graphs via matchings
cites work: Routing Permutations on Graphs via Matchings
cites work: Fast deflection routing for packets and worms
cites work: A unified framework for off-line permutation routing in parallel networks
cites work: A lower bound for nearly minimal adaptive and hot potato algorithms
cites work: Q4228428
cites work: Bounds on evacuation time for deflection routing
cites work: Q4525720
cites work: Routing permutations on a graph
cites work: Dynamic tree routing under the “matching with consumption” model
description: scientific article; zbMATH DE number 1177662