An efficiently solvable case of the minimum weight equivalent subgraph problem (Q3706869)
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 3934804
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An efficiently solvable case of the minimum weight equivalent subgraph problem |
scientific article; zbMATH DE number 3934804 |
Statements
An efficiently solvable case of the minimum weight equivalent subgraph problem (English)
0 references
1985
0 references
minimum weight equivalent subgraph problem
0 references
directed network
0 references
strong connectivity structure
0 references
series-parallel graphs
0 references
0.802542507648468
0 references
0.8004831075668335
0 references
0.7860686182975769
0 references
0.7860682010650635
0 references
0.7824385762214661
0 references
