A parallel algorithm for finding minimum cutsets in reducible graphs (Q1328109)
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 parallel algorithm for finding minimum cutsets in reducible graphs |
scientific article; zbMATH DE number 599266
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A parallel algorithm for finding minimum cutsets in reducible graphs |
scientific article; zbMATH DE number 599266 |
Statements
A parallel algorithm for finding minimum cutsets in reducible graphs (English)
0 references
1 March 1995
0 references
reducible graphs
0 references
minimal cutsets
0 references
0.91728747
0 references
0.9172521
0 references
0.9069518
0 references
0.90481293
0 references
0.9038847
0 references
0.8945625
0 references
0.8932575
0 references
