Algorithms – ESA 2004
From MaRDI portal
Publication:5464589
DOI10.1007/b100428zbMath1111.68794OpenAlexW2483610301MaRDI QIDQ5464589
Naomi Nishimura, Frances A. Rosamond, Christian Knauer, Dimitrios M. Thilikos, Michael R. Fellows, Ulrike Stege, Prabhakar Ragde, S. H. Whitesides
Publication date: 18 August 2005
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b100428
Analysis of algorithms (68W40) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (7)
Improved Parameterized Algorithms for Weighted 3-Set Packing ⋮ An \(O^{*}(3.53^{3k})\)-time parameterized algorithm for the 3-set packing problem ⋮ Parameterized algorithms for weighted matching and packing problems ⋮ Algorithm engineering for color-coding with applications to signaling pathway detection ⋮ Faster fixed-parameter tractable algorithms for matching and packing problems ⋮ An improved kernelization algorithm for \(r\)-set packing ⋮ On counting 3-D matchings of size \(k\)
This page was built for publication: Algorithms – ESA 2004
