Bounds on mincut for Cayley graphs over Abelian groups
type: Item
instance of: scholarly article
title: Bounds on mincut for Cayley graphs over Abelian groups
zbMATH Open document ID: 1184.05062
author: Vladimir Lipets
published in: Theory of Computing Systems
publication date: 2009-10-19T00:00:00Z
Mathematics Subject Classification ID: 05C25
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68W05
zbMATH DE Number: 5617704
zbMATH Keywords: graph theory
zbMATH Keywords: Cayley graphs
zbMATH Keywords: bisection
zbMATH Keywords: mincut
zbMATH Keywords: bounds
zbMATH Keywords: algorithms
zbMATH Keywords: combinatorial optimization
MaRDI profile type: Publication
full work available at URL: s00224-008-9105-2
OpenAlex ID: W2022811082
cites work: On the diameter and bisector size of Cayley graphs
cites work: The Bandwidth of Caterpillars with Hairs of Length 1 and 2
cites work: Q4796189
cites work: Q3999065
cites work: Q4231911
cites work: An expository note on individual risk without aggregate uncertainty
cites work: Bandwidth edge counts for linear arrangements of rectangular grids
cites work: Complexity Results for Bandwidth Minimization
cites work: Q4192107
cites work: Bandwidth of chain graphs
cites work: Automorphisms, isotone self-maps and cycle-free orders
cites work: On finding the minimum bandwidth of interval graphs
cites work: Q3725545
cites work: Cutwidth of the de Bruijn graph
cites work: Q4862905
cites work: A polynomial algorithm for the min-cut linear arrangement of trees
DOI: 10.1007/S00224-008-9105-2
description: scientific article; zbMATH DE number 5617704