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

Load balanced tree embeddings

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

DOI10.1016/0167-8191(92)90001-NzbMath0752.68012MaRDI QIDQ1199090

Susanne E. Hambrusch, Ajay K. Gupta

Publication date: 16 January 1993

Published in: Parallel Computing (Search for Journal in Brave)


zbMATH Keywords

dilationlower boundscongestiongraph embeddingsloadbinary tree networks


Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10)








This page was built for publication: Load balanced tree embeddings

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1199090&oldid=13263791"
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 05:59.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki