A parameterized perspective on packing paths of length two (Q849135): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Approximation algorithms for some vehicle routing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for the test cover problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametric Duality and Kernelization: Lower Bounds and Upper Bounds on Kernel Size / rank
 
Normal rank
Property / cites work
 
Property / cites work: The \(k\)-feature set problem is \(W[2]\)-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: SOFSEM 2006: Theory and Practice of Computer Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4417671 / rank
 
Normal rank
Property / cites work
 
Property / cites work: SOFSEM 2005: Theory and Practice of Computer Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Parameterized Perspective on Packing Paths of Length Two / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3270978 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approximation algorithm for maximum packing of 3-edge paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approximation algorithm for maximum triangle packing / 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: Parameterized complexity of finding subgraphs with hereditary properties. / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the completeness of a generalized matching problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3576691 / 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: The P k Partition Problem and Related Problems in Bipartite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Problem Kernelization for Graph Packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equivalence between the minimum covering problem and the maximum matching problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms and Data Structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized and Exact Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Improved Parameterized Algorithm for a Generalized Matching Problem / rank
 
Normal rank

Latest revision as of 12:20, 2 July 2024

scientific article
Language Label Description Also known as
English
A parameterized perspective on packing paths of length two
scientific article

    Statements

    A parameterized perspective on packing paths of length two (English)
    0 references
    0 references
    0 references
    24 February 2010
    0 references
    0 references
    parameterized algorithms
    0 references
    extremal combinatorics
    0 references
    0 references