A simple systolic method to find all bridges of an undirected graph (Q1823709)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4115997
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A simple systolic method to find all bridges of an undirected graph |
scientific article; zbMATH DE number 4115997 |
Statements
A simple systolic method to find all bridges of an undirected graph (English)
0 references
1989
0 references
systolic algorithm
0 references
bridges in graphs
0 references
transitive closure
0 references
mesh-connected processor array
0 references
0.9267981
0 references
0.92040706
0 references
0.83952415
0 references
0.83569694
0 references
0 references
0.83443487
0 references
0.82928824
0 references
0.82827437
0 references
0.82804275
0 references
