Parameterized and Approximation Algorithms for Finding Two Disjoint Matchings (Q2867103)
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: Parameterized and Approximation Algorithms for Finding Two Disjoint Matchings |
scientific article; zbMATH DE number 6237110
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Parameterized and Approximation Algorithms for Finding Two Disjoint Matchings |
scientific article; zbMATH DE number 6237110 |
Statements
Parameterized and Approximation Algorithms for Finding Two Disjoint Matchings (English)
0 references
10 December 2013
0 references
fixed-parameter algorithms
0 references
approximation algorithms
0 references
graph algorithms
0 references
matchings
0 references
NP-hardness
0 references
1.0000002
0 references
0.90350837
0 references
0.89908177
0 references
0.8916502
0 references
0 references
0.8902453
0 references
