Bounds on mincut for Cayley graphs over Abelian groups

DOI10.1007/s00224-008-9105-2zbMath1184.05062OpenAlexW2022811082MaRDI QIDQ733724

Vladimir Lipets

Publication date: 19 October 2009

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00224-008-9105-2

zbMATH Keywords

algorithmscombinatorial optimizationgraph theoryboundsCayley graphsbisectionmincut

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (1)

On the construction of all shortest vertex-disjoint paths in Cayley graphs of abelian groups

Cites Work

• Bandwidth of chain graphs
• An expository note on individual risk without aggregate uncertainty
• On finding the minimum bandwidth of interval graphs
• Automorphisms, isotone self-maps and cycle-free orders
• A polynomial algorithm for the min-cut linear arrangement of trees
• The Bandwidth of Caterpillars with Hairs of Length 1 and 2
• Complexity Results for Bandwidth Minimization
• Cutwidth of the de Bruijn graph
• Bandwidth edge counts for linear arrangements of rectangular grids
• On the diameter and bisector size of Cayley graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Bounds on mincut for Cayley graphs over Abelian groups