On size-constrained minimum \(s\mathrm{-}t\) cut problems and size-constrained dense subgraph problems (Q897915)
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: On size-constrained minimum s-t cut problems and size-constrained dense subgraph problems |
scientific article; zbMATH DE number 6517458
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On size-constrained minimum \(s\mathrm{-}t\) cut problems and size-constrained dense subgraph problems |
scientific article; zbMATH DE number 6517458 |
Statements
On size-constrained minimum \(s\mathrm{-}t\) cut problems and size-constrained dense subgraph problems (English)
0 references
8 December 2015
0 references
at-least-\(k\)-subgraph problem
0 references
at-most-\(k\)-subgraph problem
0 references
approximation algorithm
0 references
minimum \(s\mathrm{-}t\) cut with at-least-\(k\) vertices problem
0 references
minimum \(s\mathrm{-}t\) cut with at-most-\(k\) vertices problem
0 references
minimum \(s\mathrm{-}t\) cut with exactly \(k\) vertices problem
0 references
0 references
0.810439944267273
0 references
0.8067513108253479
0 references
0.7896599769592285
0 references
0.7783876657485962
0 references
0.7781142592430115
0 references
