Cutwidth of the de Bruijn graph
DOI10.1051/ITA/1995290605091zbMATH Open0880.05054OpenAlexW102750817MaRDI QIDQ4359288FDOQ4359288
Imrich Vrt'o, Ondrej Sýkora, André Raspaud
Publication date: 8 October 1997
Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/92521
Recommendations
Directed graphs (digraphs), tournaments (05C20) Graph theory (including graph drawing) in computer science (68R10) Extremal problems in graph theory (05C35) Connectivity (05C40) Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) (68W35)
Cites Work
- Title not available (Why is that?)
- A polynomial algorithm for the min-cut linear arrangement of trees
- Title not available (Why is that?)
- On bandwidth, cutwidth, and quotient graphs
- Area-time lower-bound techniques with applications to sorting
- Upper and Lower Bounds on the Complexity of the Min-Cut Linear Arrangement Problem on Trees
- Congestion optimale du plongement de l’hypercube $H (n)$ dans la chaîne $P(2^n)$
Cited In (8)
- Wide diameters of de Bruijn graphs
- Bounds on mincut for Cayley graphs over Abelian groups
- Tailored heuristics in adaptive large neighborhood search applied to the cutwidth minimization problem
- Strong SDP based bounds on the cutwidth of a graph
- Branch and bound for the cutwidth minimization problem
- Cutwidth of the \(r\)-dimensional mesh of \(d\)-ary trees
- Minimal cutwidth linear arrangements of abelian Cayley graphs
- Graph parameters measuring neighbourhoods in graphs-bounds and applications
This page was built for publication: Cutwidth of the de Bruijn graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4359288)
