On the Parameterized Complexity of Counting Small-Sized Minimum \(\boldsymbol{(S,T)}\)-Cuts (Q6157971)
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 7700268
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the Parameterized Complexity of Counting Small-Sized Minimum \(\boldsymbol{(S,T)}\)-Cuts |
scientific article; zbMATH DE number 7700268 |
Statements
On the Parameterized Complexity of Counting Small-Sized Minimum \(\boldsymbol{(S,T)}\)-Cuts (English)
0 references
22 June 2023
0 references
parameterized complexity
0 references
counting problems
0 references
minimum \((S,T)\)-cuts
0 references
0 references
0 references
0 references
0.7879683375358582
0 references
0.781914234161377
0 references
0.7766543030738831
0 references
0.7712058424949646
0 references
0.769551694393158
0 references
