Quadratic vertex kernel for rainbow matching (Q2300725): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s00453-019-00618-0 / rank
Normal rank
 
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.1007/s00453-019-00618-0 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2969646029 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rainbow matchings in \(r\)-partite \(r\)-graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multicolored matchings in hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Algorithms / 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: Fundamentals of parameterized complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paths, Trees, and Flowers / rank
 
Normal rank
Property / cites work
 
Property / cites work: A rainbow \(k\)-matching in the complete graph with \(r\) colors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: How many colors guarantee a rainbow matching? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized algorithms and kernels for rainbow matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-Commodity Flow / 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: Complexity results for rainbow matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rainbow matching in edge-colored graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Existences of rainbow matchings and rainbow matching covers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3395507 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approximate version of a conjecture of Aharoni and Berger / rank
 
Normal rank
Property / cites work
 
Property / cites work: NP-completeness of some generalizations of the maximum matching problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rainbow matchings in properly edge colored graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heterochromatic matchings in edge-colored graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge Dominating Sets in Graphs / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q127355484 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S00453-019-00618-0 / rank
 
Normal rank

Latest revision as of 21:21, 17 December 2024

scientific article
Language Label Description Also known as
English
Quadratic vertex kernel for rainbow matching
scientific article

    Statements

    Quadratic vertex kernel for rainbow matching (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    28 February 2020
    0 references
    rainbow matching
    0 references
    parameterized complexity
    0 references
    polynomial kernel
    0 references

    Identifiers

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