Finding the anti-block vital edge of a shortest path between two nodes (Q1016036)
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 5550472
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Finding the anti-block vital edge of a shortest path between two nodes |
scientific article; zbMATH DE number 5550472 |
Statements
Finding the anti-block vital edge of a shortest path between two nodes (English)
0 references
4 May 2009
0 references
edge failures
0 references
shortest path
0 references
anti-block vital edge
0 references
0.9484240412712096
0 references
0.8664203882217407
0 references
0.8227381706237793
0 references
0.8199723958969116
0 references
