The complexity of degree anonymization by vertex addition (Q897957)

From MaRDI portal

Jump to:navigation, search

scientific article

In more languages

Language	Label	Description	Also known as
English	The complexity of degree anonymization by vertex addition	scientific article

Statements

scholarly article

The complexity of degree anonymization by vertex addition (English)

Robert Bredereck

André Nichterlein

Rolf Niedermeier

Theoretical Computer Science

publication date

8 December 2015

zbMATH Keywords

graph modification

degree-constrained editing

NP-hardness

parameterized complexity

fixed-parameter tractability

kernelization

MaRDI profile type

MaRDI publication profile

full work available at URL

https://doi.org/10.1016/j.tcs.2015.07.004

Solving MAX-\(r\)-SAT above a tight lower bound

Parameterized Inapproximability of Degree Anonymization

The Complexity of Finding a Large Subgraph under Anonymity Constraints

The Complexity of Degree Anonymization by Vertex Addition

Advice classes of parametrized tractability

Fundamentals of parameterized complexity

Towards fully multivariate algorithmics: parameter ecology and the deconstruction of computational complexity

Parametrized complexity theory.

On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I

The Complexity of Degree Anonymization by Graph Contractions

A refined complexity analysis of degree anonymization in graphs

A remark on the existence of finite graphs

Integer Programming with a Fixed Number of Variables

Reflections on Multivariate Algorithmics and Problem Parameterization

Identifiers

Sitelinks

Mathematics(1 entry)

mardi Publication:897957

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q897957&oldid=36217042"