Maximum Minimal Vertex Cover Parameterized by Vertex Cover
Copyright policy )Maximum Minimal Vertex Cover Parameterized by Vertex Cover
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
parameterized algorithm, Analysis of algorithms and problem complexity, Approximation algorithms, vertex cover, Graph algorithms (graph-theoretic aspects), Graph theory (including graph drawing) in computer science, maximization problem, SETH, Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.), approximation algorithm, strong exponential-time hypothesis
parameterized algorithm, Analysis of algorithms and problem complexity, Approximation algorithms, vertex cover, Graph algorithms (graph-theoretic aspects), Graph theory (including graph drawing) in computer science, maximization problem, SETH, Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.), approximation algorithm, strong exponential-time hypothesis
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).12 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).Average impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!