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

Parallel graph algorithms for hypercube computers

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

DOI10.1016/0167-8191(90)90143-WzbMath0689.68090MaRDI QIDQ582120

Narsingh Deo, Sajal K. Das, Sushil K. Prasad

Publication date: 1990

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


zbMATH Keywords

connected componentsfundamental cyclebridgesspanning foresthypercube computersoptimal parallel algorithms


Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Connectivity (05C40) Theory of software (68N99)


Related Items (2)

A MULTICAST ALGORITHM FOR HYPERCUBE MULTIPROCESSORS ⋮ Stirling networks: A versatile combinatorial topology for multiprocessor systems







This page was built for publication: Parallel graph algorithms for hypercube computers

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