An algorithm for source location in directed graphs (Q1779694)
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: An algorithm for source location in directed graphs |
scientific article; zbMATH DE number 2173500
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An algorithm for source location in directed graphs |
scientific article; zbMATH DE number 2173500 |
Statements
An algorithm for source location in directed graphs (English)
0 references
1 June 2005
0 references
Source location
0 references
Edge-connectivity
0 references
Polynomial algorithm
0 references
0.8136051297187805
0 references
0.8125824332237244
0 references
0.7873860597610474
0 references
0.7767279744148254
0 references
