A shifting algorithm for continuous tree partitioning
type: Item
instance of: scholarly article
title: A shifting algorithm for continuous tree partitioning
zbMATH Open document ID: 1007.68205
DOI: 10.1016/S0304-3975(01)00075-5
author: Bruno Simeone
author: Yen-I Chiang
author: Ronald I. Becker
published in: Theoretical Computer Science
publication date: 2002-12-12T00:00:00Z
Mathematics Subject Classification ID: 68W05
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 1844820
zbMATH Keywords: graph partitioning
zbMATH Keywords: continuous partitioning
zbMATH Keywords: tree partitioning
zbMATH Keywords: optimization on trees
MaRDI profile type: Publication
cites work: A Shifting Algorithm for Min-Max Tree Partitioning
cites work: Q3317684
cites work: Fair dissections of spiders, worms, and caterpillars
cites work: Q3880849
cites work: Most uniform path partitioning and its use in image processing
cites work: Q3993417
cites work: Max-Min Tree Partitioning
cites work: Efficient implementation of a shifting algorithm
description: scientific article; zbMATH DE number 1844820