On VLSI layouts of the star graph and related networks

DOI10.1016/0167-9260(94)90021-3zbMath0813.94026OpenAlexW1998306675MaRDI QIDQ4322467

Ondrej Sýkora, Imrich Vrt'o

Publication date: 30 May 1995

Published in: Integration (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-9260(94)90021-3

zbMATH Keywords

crossing numbersstar graphpancake graphVLSI layouts

Mathematics Subject Classification ID

Applications of graph theory (05C90) Network design and communication in computer systems (68M10) Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) (68W35) Applications of graph theory to circuits and networks (94C15)

Related Items (7)

Algorithms for the fixed linear crossing number problem ⋮ Crossing number, pair-crossing number, and expansion ⋮ VLSI layouts of complete graphs and star graphs ⋮ Bisection width of transposition graphs ⋮ Planar crossing numbers of graphs of bounded genus ⋮ Orthogonal Tree Decompositions of Graphs ⋮ Biplanar crossing numbers. II. Comparing crossing numbers and biplanar crossing numbers using the probabilistic method

This page was built for publication: On VLSI layouts of the star graph and related networks