Minimum cost source location problem with vertex-connectivity requirements in digraphs (Q1607133)
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 1771823
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimum cost source location problem with vertex-connectivity requirements in digraphs |
scientific article; zbMATH DE number 1771823 |
Statements
Minimum cost source location problem with vertex-connectivity requirements in digraphs (English)
0 references
25 July 2002
0 references
digraph
0 references
undirected graph
0 references
0.8786939382553101
0 references
0.8508666753768921
0 references
0.8488485813140869
0 references
0.8419802784919739
0 references
0.8405033349990845
0 references
