A fully-pipelined systolic algorithm for finding bridges on an undirected connected graph (Q1195171)
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: A fully-pipelined systolic algorithm for finding bridges on an undirected connected graph |
scientific article; zbMATH DE number 69188
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A fully-pipelined systolic algorithm for finding bridges on an undirected connected graph |
scientific article; zbMATH DE number 69188 |
Statements
A fully-pipelined systolic algorithm for finding bridges on an undirected connected graph (English)
0 references
7 October 1992
0 references
spanning trees
0 references
systolic algorithm
0 references
bridges
0 references
undirected connected graph
0 references
