Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
Purge
English
Log in

Permutation layout

From MaRDI portal
Publication:4189280
Jump to:navigation, search

DOI10.1002/NET.3230080308zbMath0404.05002OpenAlexW4239272098MaRDI QIDQ4189280

No author found.

Publication date: 1978

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.3230080308




zbMATH Keywords

Node PathsPermutation Layout


Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Graph theory (05C99)


Related Items (7)

Routing vertex disjoint Steiner-trees in a cubic grid and connections to VLSI ⋮ General circular permutation layout ⋮ Unnamed Item ⋮ A note on solving the fleet quickest routing problem on a grid graph ⋮ Multilayer grid embeddings for VLSI ⋮ A lower bound on the area of permutation layouts ⋮ Asymptotic component densities in programmable gate arrays realizing all circuits of a given size




Cites Work

  • The crossing number of K5,n




This page was built for publication: Permutation layout

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4189280&oldid=40680425"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 28 March 2025, at 08:14.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki