Solving generalized maximum-weight connected subgraph problem for network enrichment analysis (Q1708434)
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: Solving generalized maximum-weight connected subgraph problem for network enrichment analysis |
scientific article; zbMATH DE number 6852358
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Solving generalized maximum-weight connected subgraph problem for network enrichment analysis |
scientific article; zbMATH DE number 6852358 |
Statements
Solving generalized maximum-weight connected subgraph problem for network enrichment analysis (English)
0 references
23 March 2018
0 references
network enrichment
0 references
maximum weight connected subgraph problem
0 references
exact solver
0 references
mixed integer programming
0 references
0.7787753939628601
0 references
0.7706609964370728
0 references
0.7630869150161743
0 references
0.7372905611991882
0 references
0.7111712098121643
0 references
