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

A parallel construction of vertex-disjoint spanning trees with optimal heights in star networks

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

DOI10.1007/978-3-319-71150-8_4zbMath1470.68061OpenAlexW2768841647MaRDI QIDQ1699757

Ro-Yu Wu, Jinn-Shyong Yang, Shyue-Ming Tang, Kung-Jui Pai, Jou-Ming Chang, Shih-Shun Kao

Publication date: 26 February 2018

Full work available at URL: https://doi.org/10.1007/978-3-319-71150-8_4


zbMATH Keywords

network securityinterconnection networksfault-tolerancestar networksvertex-disjoint spanning trees


Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Reliability, testing and fault tolerance of networks and computer systems (68M15)


Related Items (1)

Amortized efficiency of constructing multiple independent spanning trees on bubble-sort networks







This page was built for publication: A parallel construction of vertex-disjoint spanning trees with optimal heights in star networks

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