Crossing Numbers and Cutwidths

DOI10.7155/jgaa.00069zbMath1066.05054OpenAlexW2162557634MaRDI QIDQ4679068

Hristo N. Djidjev, Imrich Vrt'o

Publication date: 25 May 2005

Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/51428

zbMATH Keywords

drawingbisection width

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items (9)

Embeddings of circulant networks ⋮ A branch-and-bound algorithm for the minimum cut linear arrangement problem ⋮ Embedding hypercubes into cylinders, snakes and caterpillars for minimizing wirelength ⋮ A linear time algorithm for embedding locally twisted cube into grid network to optimize the layout ⋮ Optimal Embedding of Locally Twisted Cubes into Grids ⋮ Planar crossing numbers of graphs of bounded genus ⋮ Orthogonal Tree Decompositions of Graphs ⋮ Exact wirelength of hypercubes on a grid ⋮ Efficient computation of the Kauffman bracket

This page was built for publication: Crossing Numbers and Cutwidths