The complexity of degree anonymization by vertex addition
Copyright policy )The complexity of degree anonymization by vertex addition
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
- Technical University of Berlin Germany
- Technical University of Berlin Germany
Analysis of algorithms and problem complexity, Graph operations (line graphs, products, etc.), Graph theory (including graph drawing) in computer science, fixed-parameter tractability, graph modification, kernelization, NP-hardness, Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.), degree-constrained editing, parameterized complexity
Analysis of algorithms and problem complexity, Graph operations (line graphs, products, etc.), Graph theory (including graph drawing) in computer science, fixed-parameter tractability, graph modification, kernelization, NP-hardness, Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.), degree-constrained editing, 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).20 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!