Improved fixed parameter tractable algorithms for two ``edge'' problems: MAXCUT and MAXDAG (Q2379999)
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: Improved fixed parameter tractable algorithms for two ``edge problems: MAXCUT and MAXDAG |
scientific article; zbMATH DE number 5686433
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Improved fixed parameter tractable algorithms for two ``edge'' problems: MAXCUT and MAXDAG |
scientific article; zbMATH DE number 5686433 |
Statements
Improved fixed parameter tractable algorithms for two ``edge'' problems: MAXCUT and MAXDAG (English)
0 references
24 March 2010
0 references
directed feedback arc set
0 references
max-cut
0 references
parameterized complexity
0 references
exact algorithm
0 references
graph algorithms
0 references
0 references
0 references
