The cyclic cutwidth of trees
From MaRDI portal
Publication:1270769
DOI10.1016/S0166-218X(98)00098-5zbMath0909.05024OpenAlexW2103020672MaRDI QIDQ1270769
Publication date: 3 November 1998
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: http://www.elsevier.com/locate/dam
Trees (05C05) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)
Related Items (21)
Minimal congestion trees ⋮ Cyclic cutwidths of the two-dimensional ordinary and cylindrical meshes ⋮ Embeddings of circulant networks ⋮ A rigorous proof on circular wirelength for hypercubes ⋮ Embedding hypercubes into cylinders, snakes and caterpillars for minimizing wirelength ⋮ Minimum average congestion of enhanced and augmented hypercubes into complete binary trees ⋮ Wirelength of \(1\)-fault Hamiltonian graphs into wheels and fans ⋮ Embedding Wheel - like Networks ⋮ Embedding of hypercubes into necklace, windmill and snake graphs ⋮ Embedding of hypercubes into sibling trees ⋮ Bothway embedding of circulant network into grid ⋮ Embedding hypercubes and folded hypercubes onto Cartesian product of certain trees ⋮ Wirelength of hypercubes into certain trees ⋮ A linear time algorithm for embedding hypercube into cylinder and torus ⋮ Maximum incomplete recursive circulants in graph embeddings ⋮ Multistart search for the cyclic cutwidth minimization problem ⋮ Embedding of recursive circulants into certain necklace graphs ⋮ Multiplicity of finite graphs over the real line ⋮ The cyclic wirelength of trees ⋮ Exact wirelength of hypercubes on a grid ⋮ On spanning tree congestion
Cites Work
This page was built for publication: The cyclic cutwidth of trees
