Bounds on mincut for Cayley graphs over Abelian groups
From MaRDI portal
Publication:733724
DOI10.1007/s00224-008-9105-2zbMath1184.05062MaRDI QIDQ733724
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
68W05: Nonnumerical algorithms
68R10: Graph theory (including graph drawing) in computer science
05C25: Graphs and abstract algebra (groups, rings, fields, etc.)
05C85: Graph algorithms (graph-theoretic aspects)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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