Parameterized and approximation algorithms for finding two disjoint matchings (Q300238): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Importer (talk | contribs)
Changed an Item
Property / author
 
Property / author: Lusheng Wang / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q25 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C70 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C85 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68W20 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68W25 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6598550 / rank
 
Normal rank
Property / zbMATH Keywords
 
fixed-parameter algorithms
Property / zbMATH Keywords: fixed-parameter algorithms / rank
 
Normal rank
Property / zbMATH Keywords
 
approximation algorithms
Property / zbMATH Keywords: approximation algorithms / rank
 
Normal rank
Property / zbMATH Keywords
 
color-coding
Property / zbMATH Keywords: color-coding / rank
 
Normal rank
Property / zbMATH Keywords
 
universal sets
Property / zbMATH Keywords: universal sets / rank
 
Normal rank
Property / zbMATH Keywords
 
matchings
Property / zbMATH Keywords: matchings / rank
 
Normal rank

Revision as of 22:45, 27 June 2023

scientific article
Language Label Description Also known as
English
Parameterized and approximation algorithms for finding two disjoint matchings
scientific article

    Statements

    Parameterized and approximation algorithms for finding two disjoint matchings (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    27 June 2016
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    fixed-parameter algorithms
    0 references
    approximation algorithms
    0 references
    color-coding
    0 references
    universal sets
    0 references
    matchings
    0 references