Minimal cutwidth linear arrangements of abelian Cayley graphs
From MaRDI portal
Publication:942098
DOI10.1016/j.disc.2007.08.083zbMath1198.05139OpenAlexW1968354899MaRDI QIDQ942098
Vladimir Lipets, Daniel Berend, Ephraim Korach
Publication date: 4 September 2008
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2007.08.083
Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Graph algorithms (graph-theoretic aspects) (05C85)
Cites Work
- On minimizing width in linear layouts
- Graph minors. X: Obstructions to tree-decomposition
- Incidence matrices, interval graphs and seriation in archeology
- A polynomial algorithm for the min-cut linear arrangement of trees
- Upper and Lower Bounds on the Complexity of the Min-Cut Linear Arrangement Problem on Trees
- Single Machine Job Sequencing with Precedence Constraints
- Complexity Results for Bandwidth Minimization
- A Randomized Fully Polynomial Time Approximation Scheme for the All-Terminal Network Reliability Problem
- Cutwidth of the de Bruijn graph
- Optimal Linear Ordering
- Mapping the genome
- A polyhedral approach to planar augmentation and related problems
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Minimal cutwidth linear arrangements of abelian Cayley graphs
