Fast, Efficient Parallel Algorithms for Some Graph Problems (Q3932299)
From MaRDI portal
![]() | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Fast, Efficient Parallel Algorithms for Some Graph Problems |
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Fast, Efficient Parallel Algorithms for Some Graph Problems |
scientific article |
Statements
Fast, Efficient Parallel Algorithms for Some Graph Problems (English)
0 references
1981
0 references
graph algorithm
0 references
minimum spanning tree
0 references
biconnected component
0 references
bridge
0 references
fundamental cycle
0 references
multiprocessing
0 references