On some matching problems under the color-spanning model (Q2319899): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
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.2018.08.008 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2886997252 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4796181 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unit disk graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4393480 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the parameterized complexity of multiple-interval graph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing Minimum Diameter Color-Spanning Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing minimum diameter color-spanning sets is hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametrized complexity theory. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for two bottleneck optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On some geometric problems of color-spanning sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3048571 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms – ESA 2005 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The parameterized complexity of the induced matching problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized complexity of finding regular induced subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3992847 / rank
 
Normal rank

Latest revision as of 05:28, 20 July 2024

scientific article
Language Label Description Also known as
English
On some matching problems under the color-spanning model
scientific article

    Statements

    On some matching problems under the color-spanning model (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    20 August 2019
    0 references
    fixed-parameter tractability
    0 references
    computational geometry
    0 references
    matching algorithms
    0 references
    FPT algorithms
    0 references
    color-spanning model
    0 references
    NP-completeness
    0 references

    Identifiers

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