Minimum cost source location problem with local 3-vertex-connectivity requirements (Q870842)
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 5134102
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimum cost source location problem with local 3-vertex-connectivity requirements |
scientific article; zbMATH DE number 5134102 |
Statements
Minimum cost source location problem with local 3-vertex-connectivity requirements (English)
0 references
15 March 2007
0 references
graph algorithm
0 references
undirected graph
0 references
location problem
0 references
local vertex-connectivity
0 references
polynomial time algorithm
0 references
0 references
0 references
0.929449200630188
0 references
0.8877745866775513
0 references
0.8869533538818359
0 references
0.8786939382553101
0 references
