Faster fixed-parameter tractable algorithms for matching and packing problems (Q958209): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s00453-007-9146-y / rank
Normal rank
 
Property / Wikidata QID
 
Property / Wikidata QID: Q57359876 / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00453-007-9146-y / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2051064851 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Color-coding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structure preserving reductions among convex optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4474212 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2934608 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph-Theoretic Concepts in Computer Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph-Theoretic Concepts in Computer Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph-Theoretic Concepts in Computer Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms – ESA 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Storing a Sparse Table with <i>0</i> (1) Worst Case Access Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient parameterized algorithm for m-set packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Divide-and-Color / rank
 
Normal rank
Property / cites work
 
Property / cites work: A faster parameterized algorithm for set packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Greedy Localization and Color-Coding: Improved Matching and Packing Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized complexity of constraint satisfaction problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4414647 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S00453-007-9146-Y / rank
 
Normal rank

Latest revision as of 09:59, 10 December 2024

scientific article
Language Label Description Also known as
English
Faster fixed-parameter tractable algorithms for matching and packing problems
scientific article

    Statements

    Faster fixed-parameter tractable algorithms for matching and packing problems (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    2 December 2008
    0 references
    parameterized complexity
    0 references
    fixed parameter tractable
    0 references
    graph matching
    0 references
    set packing
    0 references
    color coding
    0 references

    Identifiers

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