# Parameterized Complexity of the Anchored k-Core Problem for Directed Graphs

@inproceedings{Chitnis2013ParameterizedCO, title={Parameterized Complexity of the Anchored k-Core Problem for Directed Graphs}, author={Rajesh Hemant Chitnis and Fedor V. Fomin and Petr A. Golovach}, booktitle={FSTTCS}, year={2013} }

We consider the Directed Anchored k-Core problem, where the task is for a given directed graph G and integers b, k and p, to find an induced subgraph H with at least p vertices (the core) such that all but at most b vertices (the anchors) of H have in-degree at least k. For undirected graphs, this problem was introduced by Bhawalkar, Kleinberg, Lewi, Roughgarden, and Sharma [ICALP 2012]. We undertake a
systematic analysis of the computational complexity of Directed Anchored k-Core and show… CONTINUE READING

#### Citations

##### Publications citing this paper.

SHOWING 1-10 OF 13 CITATIONS

## Cohesive subgraph mining on social networks

VIEW 4 EXCERPTS

CITES BACKGROUND

HIGHLY INFLUENCED

## OLAK: An Efficient Algorithm to Prevent Unraveling in Social Networks

VIEW 3 EXCERPTS

CITES BACKGROUND

HIGHLY INFLUENCED

## Building large k-cores from sparse graphs

VIEW 1 EXCERPT

CITES BACKGROUND

## Finding Critical Users in Social Communities: The Collapsed Core and Truss Problems

VIEW 1 EXCERPT

CITES METHODS

## A Parameterized Complexity View on Collapsing k-Cores

VIEW 1 EXCERPT

CITES BACKGROUND

## Can We Create Large k-Cores by Adding Few Edges?

VIEW 1 EXCERPT

CITES METHODS

## Efficient Implementation of Anchored 2-core Algorithm

VIEW 1 EXCERPT

CITES BACKGROUND

## Finding Critical Users for Social Network Engagement: The Collapsed k-Core Problem

VIEW 2 EXCERPTS

CITES METHODS & BACKGROUND

#### References

##### Publications referenced by this paper.

SHOWING 1-10 OF 23 REFERENCES

## Fundamentals of Parameterized Complexity

VIEW 13 EXCERPTS

HIGHLY INFLUENTIAL

## Preventing Unraveling in Social Networks: The Anchored k-Core Problem

VIEW 9 EXCERPTS

HIGHLY INFLUENTIAL

## Color coding.

VIEW 9 EXCERPTS

HIGHLY INFLUENTIAL

## Preventing Unraveling in Social Networks Gets Harder

VIEW 2 EXCERPTS

## Deciding First-Order Properties for Sparse Graphs

VIEW 1 EXCERPT

## Parameterized graph separation problems

VIEW 1 EXCERPT

## Computing small partial coverings

VIEW 1 EXCERPT