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 algorithm for the enumeration of the spanning trees of a graph

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

DOI10.1016/S0167-8191(84)90197-2zbMath0564.68051OpenAlexW2051184192MaRDI QIDQ1058301

David J. Evans, Shaowen Mai

Publication date: 1985

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

Full work available at URL: https://doi.org/10.1016/s0167-8191(84)90197-2


zbMATH Keywords

parallel algorithmspanning treesMIMD computer


Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)








This page was built for publication: A parallel algorithm for the enumeration of the spanning trees of a graph

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