Optimal parallel algorithm for finding \(st\)-ambitus of a planar biconnected graph (Q1908264)
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: Publication:1908264 |
scientific article; zbMATH DE number 847570
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Optimal parallel algorithm for finding \(st\)-ambitus of a planar biconnected graph |
scientific article; zbMATH DE number 847570 |
Statements
Optimal parallel algorithm for finding \(st\)-ambitus of a planar biconnected graph (English)
0 references
27 June 1996
0 references
graph algorithms
0 references
biconnected graph
0 references
bridges
0 references
0.8182307481765747
0 references
0.7514720559120178
0 references
0.7428674101829529
0 references
