Minimal cutwidth linear arrangements of abelian Cayley graphs

Daniel Berend; Ephraim Korach; Vladimir Lipets

doi:10.1016/j.disc.2007.08.083

Minimal cutwidth linear arrangements of abelian Cayley graphs

Daniel Berend
, Ephraim Korach
, Vladimir Lipets

Department of Industrial Engineering and Management

Research output: Contribution to journal › Article › peer-review

Abstract

We find the minimal cutwidth and bisection width values for abelian Cayley graphs with up to 4 generators and present an algorithm for finding the corresponding optimal ordering. We also find minimal cuts of each order.

Original language	English
Pages (from-to)	4670-4695
Number of pages	26
Journal	Discrete Mathematics
Volume	308
Issue number	20
DOIs	https://doi.org/10.1016/j.disc.2007.08.083
State	Published - 28 Oct 2008

Keywords

Cayley graph
Combinatorial optimization
Graph algorithm
MINCUT linear arrangement

ASJC Scopus subject areas

Theoretical Computer Science
Discrete Mathematics and Combinatorics

Access to Document

10.1016/j.disc.2007.08.083

Cite this

@article{fb90676822bb49c8b8fe06b0baa5d38f,

title = "Minimal cutwidth linear arrangements of abelian Cayley graphs",

abstract = "We find the minimal cutwidth and bisection width values for abelian Cayley graphs with up to 4 generators and present an algorithm for finding the corresponding optimal ordering. We also find minimal cuts of each order.",

keywords = "Cayley graph, Combinatorial optimization, Graph algorithm, MINCUT linear arrangement",

author = "Daniel Berend and Ephraim Korach and Vladimir Lipets",

year = "2008",

month = oct,

day = "28",

doi = "10.1016/j.disc.2007.08.083",

language = "English",

volume = "308",

pages = "4670--4695",

journal = "Discrete Mathematics",

issn = "0012-365X",

publisher = "Elsevier B.V.",

number = "20",

}

TY - JOUR

T1 - Minimal cutwidth linear arrangements of abelian Cayley graphs

AU - Berend, Daniel

AU - Korach, Ephraim

AU - Lipets, Vladimir

PY - 2008/10/28

Y1 - 2008/10/28

N2 - We find the minimal cutwidth and bisection width values for abelian Cayley graphs with up to 4 generators and present an algorithm for finding the corresponding optimal ordering. We also find minimal cuts of each order.

AB - We find the minimal cutwidth and bisection width values for abelian Cayley graphs with up to 4 generators and present an algorithm for finding the corresponding optimal ordering. We also find minimal cuts of each order.

KW - Cayley graph

KW - Combinatorial optimization

KW - Graph algorithm

KW - MINCUT linear arrangement

UR - https://www.scopus.com/pages/publications/48449087992

U2 - 10.1016/j.disc.2007.08.083

DO - 10.1016/j.disc.2007.08.083

M3 - Article

AN - SCOPUS:48449087992

SN - 0012-365X

VL - 308

SP - 4670

EP - 4695

JO - Discrete Mathematics

JF - Discrete Mathematics

IS - 20

ER -

Minimal cutwidth linear arrangements of abelian Cayley graphs

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this