Articles citing this article

The Citing articles tool gives a list of articles citing the current article.
The citing articles come from EDP Sciences database, as well as other publishers participating in CrossRef Cited-by Linking Program. You can set up your personal account to receive an email alert each time this article is cited by a new article (see the menu on the right-hand side of the abstract page).

Cited article:

Cutwidth of the de Bruijn graph

André Raspaud, Ondrej Sýkora, Imrich Vrt'o

RAIRO-Theor. Inf. Appl., 29 6 (1995) 509-514

Published online: 2017-02-01

DOI: https://doi.org/10.1051/ita/1995290605091

This article has been cited by the following article(s):

Strong SDP based bounds on the cutwidth of a graph

Elisabeth Gaar, Diane Puges and Angelika Wiegele
Computers & Operations Research 161 106449 (2024)
https://doi.org/10.1016/j.cor.2023.106449

Two novel branch and bound algorithms for the vertex bisection problem

Carlos Soto, Eduardo Del Ángel-Martínez, Héctor Fraire-Huacuja, et al.
Expert Systems with Applications 190 116169 (2022)
https://doi.org/10.1016/j.eswa.2021.116169

Tailored heuristics in adaptive large neighborhood search applied to the cutwidth minimization problem

Vinícius Gandra Martins Santos and Marco Antonio Moreira de Carvalho
European Journal of Operational Research 289 (3) 1056 (2021)
https://doi.org/10.1016/j.ejor.2019.07.013

Ullmann's Encyclopedia of Industrial Chemistry

Hagen Trommer
Ullmann's Encyclopedia of Industrial Chemistry 1 (2018)
https://doi.org/10.1002/9783527306732.a02_269.pub4

Branch and bound for the cutwidth minimization problem

Rafael Martí, Juan J. Pantrigo, Abraham Duarte and Eduardo G. Pardo
Computers & Operations Research 40 (1) 137 (2013)
https://doi.org/10.1016/j.cor.2012.05.016

Scatter search for the cutwidth minimization problem

Juan J. Pantrigo, Rafael Martí, Abraham Duarte and Eduardo G. Pardo
Annals of Operations Research 199 (1) 285 (2012)
https://doi.org/10.1007/s10479-011-0907-2

Richa Bansal, Kamal Srivastava and Sanjay Srivastava
1 (2012)
https://doi.org/10.1109/CEC.2012.6256549

Bounds on Mincut for Cayley Graphs over Abelian Groups

Vladimir Lipets
Theory of Computing Systems 45 (2) 372 (2009)
https://doi.org/10.1007/s00224-008-9105-2

Graph parameters measuring neighbourhoods in graphs—Bounds and applications

Frank Gurski
Discrete Applied Mathematics 156 (10) 1865 (2008)
https://doi.org/10.1016/j.dam.2007.09.004

Minimal cutwidth linear arrangements of abelian Cayley graphs

Daniel Berend, Ephraim Korach and Vladimir Lipets
Discrete Mathematics 308 (20) 4670 (2008)
https://doi.org/10.1016/j.disc.2007.08.083

IMPROVED BOUNDS ON CUTWIDTHS OF SHUFFLE-EXCHANGE AND DE BRUIJN GRAPHS

BURKHARD MONIEN and IMRICH VRŤO
Parallel Processing Letters 14 (03n04) 361 (2004)
https://doi.org/10.1142/S0129626404001945

A survey of graph layout problems

Josep Díaz, Jordi Petit and Maria Serna
ACM Computing Surveys 34 (3) 313 (2002)
https://doi.org/10.1145/568522.568523