Faster exact algorithms for some terminal set problems (Q2361353)
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 6737607
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Faster exact algorithms for some terminal set problems |
scientific article; zbMATH DE number 6737607 |
Statements
Faster exact algorithms for some terminal set problems (English)
0 references
30 June 2017
0 references
exact exponential time algorithms
0 references
terminal set problems
0 references
multiway cut
0 references
feedback vertex set
0 references
0 references
0.9621126055717468
0 references
0.7870495319366455
0 references
0.7793862819671631
0 references
0.7780149579048157
0 references
0.7761707305908203
0 references
