A Problem Kernelization for Graph Packing (Q3599088): 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.1007/978-3-540-95891-8_37 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1519122062 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kernelization Algorithms for d-Hitting Set Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Cubic Kernel for Feedback Vertex Set / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Problems without Polynomial Kernels (Extended Abstract) / 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: Vertex Cover: Further Observations and Further Improvements / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2934608 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4437505 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph-Theoretic Concepts in Computer Science / 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: Efficient Parameterized Preprocessing for Cluster Editing / 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: Q3549693 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph-modeled data clustering: Exact algorithms for clique generation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A More Effective Linear Kernelization for Cluster Editing / 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: Divide-and-Color / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster Algebraic Algorithms for Path and Packing Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing triangles in low degree graphs and indifference graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex packings: Structural properties and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5710169 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Looking at the stars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applying modular decomposition to parameterized cluster editing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Parameterized Algorithms for Weighted 3-Set Packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: An O *(3.523k ) Parameterized Algorithm for 3-Set Packing / 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 00:22, 29 June 2024

scientific article
Language Label Description Also known as
English
A Problem Kernelization for Graph Packing
scientific article

    Statements

    A Problem Kernelization for Graph Packing (English)
    0 references
    0 references
    3 February 2009
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers