Minimal cutwidth linear arrangements of abelian Cayley graphs

Autor:	Vladimir Lipets, Ephraim Korach, Daniel Berend
Rok vydání:	2008
Předmět:	Discrete mathematics Combinatorics Combinatorial optimization Cayley graph Computer Science::Discrete Mathematics Graph algorithm MINCUT linear arrangement Discrete Mathematics and Combinatorics Order (group theory) Abelian group Theoretical Computer Science Mathematics
Zdroj:	Discrete Mathematics. 308:4670-4695
ISSN:	0012-365X
DOI:	10.1016/j.disc.2007.08.083
Popis:	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.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_dedup___::089af9ee80830a5107bdc8ca61924552 https://doi.org/10.1016/j.disc.2007.08.083 Zobrazit plný text záznamu Full Text from ScienceDirect