Minimal cutwidth linear arrangements of abelian Cayley graphs
type: Item
instance of: scholarly article
title: Minimal cutwidth linear arrangements of abelian Cayley graphs
zbMATH Open document ID: 1198.05139
author: Vladimir Lipets
author: Daniel Berend
author: Ephraim Korach
published in: Discrete Mathematics
publication date: 2008-09-04T00:00:00Z
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 05C25
zbMATH DE Number: 5321341
zbMATH Keywords: combinatorial optimization
zbMATH Keywords: graph algorithm
zbMATH Keywords: Cayley graph
zbMATH Keywords: MINCUT linear arrangement
MaRDI profile type: Publication
full work available at URL: j.disc.2007.08.083
OpenAlex ID: W1968354899
cites work: Single Machine Job Sequencing with Precedence Constraints
cites work: Optimal Linear Ordering
cites work: Complexity Results for Bandwidth Minimization
cites work: Q4192107
cites work: A Randomized Fully Polynomial Time Approximation Scheme for the All-Terminal Network Reliability Problem
cites work: Mapping the genome
cites work: Incidence matrices, interval graphs and seriation in archeology
cites work: Upper and Lower Bounds on the Complexity of the Min-Cut Linear Arrangement Problem on Trees
cites work: On minimizing width in linear layouts
cites work: Q3725545
cites work: Q3477932
cites work: Q3717085
cites work: A polyhedral approach to planar augmentation and related problems
cites work: Cutwidth of the de Bruijn graph
cites work: Q4036610
cites work: Graph minors. X: Obstructions to tree-decomposition
cites work: Parallel iterative methods for sparse linear systems
cites work: A polynomial algorithm for the min-cut linear arrangement of trees
DOI: 10.1016/J.DISC.2007.08.083
description: scientific article; zbMATH DE number 5321341