Complexity results for rainbow matchings (Q2637345): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2034652539 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1312.7253 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some APX-completeness results for cubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized complexity of the weighted independent set problem beyond graphs of bounded clique number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rainbow matchings of size \(\delta(G)\) in properly edge-colored graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4503944 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster fixed-parameter tractable algorithms for matching and packing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametrized complexity theory. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4400840 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Size of Systems of Sets Every <i>t</i> of which Have an SDR, with an Application to the Worst-Case Ratio of Heuristics for Packing Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Matching Problems for Bipartite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monochromatic and heterochromatic subgraphs in edge-colored graphs - A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Large Rainbow Matchings in Edge-Coloured Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on large rainbow matchings in edge-coloured graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5710169 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization, approximation, and complexity classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A theory of alternating paths and blossoms for proving correctness of the \(O(\sqrt{V}E)\) general graph maximum matching algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rainbow matchings in properly edge colored graphs / rank
 
Normal rank

Latest revision as of 07:57, 7 July 2024

scientific article
Language Label Description Also known as
English
Complexity results for rainbow matchings
scientific article

    Statements

    Complexity results for rainbow matchings (English)
    0 references
    0 references
    0 references
    11 February 2014
    0 references
    rainbow matching
    0 references
    computational complexity
    0 references
    NP-completeness
    0 references
    APX-completeness
    0 references
    parameterized complexity
    0 references

    Identifiers

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