A Tight Lower Bound on the Size of Planar Permutation Networks

DOI10.1137/0405045zbMath0776.05039OpenAlexW2015742883MaRDI QIDQ4030194

Leighton, Tom, Maria M. Klawe

Publication date: 1 April 1993

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0405045

zbMATH Keywords

planar graphslower boundrectangular gridspermutation networkpermutation layout

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Applications of graph theory to circuits and networks (94C15)

This page was built for publication: A Tight Lower Bound on the Size of Planar Permutation Networks