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

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q166206
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2014.03.030 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1969297684 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Color-coding / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Linear Time Minor Tests with Depth-First Search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomized Divide-and-Conquer: Improved Path, Matching, and Packing Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating Maximum Edge 2-Coloring in Simple Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating Maximum Edge 2-Coloring in Simple Graphs Via Local Improvement / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Improved Approximation Algorithm for Maximum Edge 2-Coloring in Simple Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved randomized approximation algorithm for Max TSP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4411281 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3138921 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Better approximations for max TSP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the maximum 2- and 3-edge-colorable subgraph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing \([1, \Delta ]\)-factors in graphs of small degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4231923 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the maximum 3-edge-colorable subgraph problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3686457 / rank
 
Normal rank

Latest revision as of 05:25, 12 July 2024

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
    27 June 2016
    0 references
    fixed-parameter algorithms
    0 references
    approximation algorithms
    0 references
    color-coding
    0 references
    universal sets
    0 references
    matchings
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references