Faster Fixed-Parameter Tractable Algorithms for Matching and Packing Problems
Copyright policy )Faster Fixed-Parameter Tractable Algorithms for Matching and Packing Problems
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
- Freie Universität Berlin Germany
- University of Newcastle Australia Australia
- University of Waterloo Canada
- Universitat Politècnica de Catalunya Spain
- McGill University Canada
graph matching, Analysis of algorithms and problem complexity, fixed parameter tractable, color coding, Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.), Graph algorithms (graph-theoretic aspects), Analysis of algorithms, set packing, Nonnumerical algorithms, parameterized complexity
graph matching, Analysis of algorithms and problem complexity, fixed parameter tractable, color coding, Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.), Graph algorithms (graph-theoretic aspects), Analysis of algorithms, set packing, Nonnumerical algorithms, parameterized complexity
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).52 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Top 10% influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Top 10% impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Top 10%
Citations provided by BIP!Popularity provided by BIP!