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

On Rearrangeability of Multirate Clos Networks

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

DOI10.1137/S0097539796313921zbMath0972.94050MaRDI QIDQ4268705

Guo-Hui Lin, Guoliang Xue, Xiao-Dong Hu, Ding-Zhu Du

Publication date: 28 October 1999

Published in: SIAM Journal on Computing (Search for Journal in Brave)


zbMATH Keywords

rearrangeabilityminimization of the number of center switchesmultirate Clos networks


Mathematics Subject Classification ID

Applications of graph theory (05C90) Communication networks in operations research (90B18) Network design and communication in computer systems (68M10)


Related Items

On rearrangeable multirate three-stage Clos networks, Constructions of given-depth and optimal multirate rearrangeably nonblocking distributors, A new routing algorithm for multirate rearrangeable Clos networks., Edge Coloring and Decompositions of Weighted Graphs



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