Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Embedding grids into hypercubes

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

DOI10.1016/0022-0000(92)90030-MzbMath0794.68003MaRDI QIDQ1201880

Ivan Hal Sudborough, Zevi Miller, Saïd Bettayeb

Publication date: 17 January 1993

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)


zbMATH Keywords

dilationoptimal hypercube


Mathematics Subject Classification ID

Mathematical problems of computer architecture (68M07) Applications of graph theory to circuits and networks (94C15)


Related Items (4)

Integer matrices with constraints on leading partial row and column sums ⋮ Compressing grids into small hypercubes ⋮ On the k-ary hypercube ⋮ Embedding multidimensional grids into optimal hypercubes




Cites Work

  • Unnamed Item
  • Embedding of Grids into Optimal Hypercubes
  • Polynomial Time Algorithms for the MIN CUT Problem on Degree Restricted Trees
  • On embedding rectangular grids in hypercubes
  • Parallel Matrix and Graph Algorithms
  • A Scheme for Fast Parallel Communication
  • On Embedding Rectangular Grids in Square Grids




This page was built for publication: Embedding grids into hypercubes

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1201880&oldid=13264979"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 06:04.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki