Parameterized complexity of the anchored \(k\)-core problem for directed graphs
type: Item
instance of: scholarly article
title: Parameterized complexity of the anchored \(k\)-core problem for directed graphs
zbMATH Open document ID: 1336.68119
author: Rajesh Chitnis
author: Fedor V. Fomin
author: Petr A. Golovach
published in: Information and Computation
publication date: 2016-03-10T00:00:00Z
full work available at URL: https://arxiv.org/abs/1304.5870
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 05C20
zbMATH DE Number: 6553690
zbMATH Keywords: parameterized complexity
zbMATH Keywords: directed graphs
zbMATH Keywords: anchored \(k\)-core
MaRDI profile type: Publication
OpenAlex ID: W1812795470
Wikidata QID: Q60488380
arXiv ID: 1304.5870
cites work: Color-coding
cites work: Preventing Unraveling in Social Networks: The Anchored k-Core Problem
cites work: Computing small partial coverings
cites work: Random Separation: A New Method for Solving Fixed-Cardinality Optimization Problems
cites work: Fixed-parameter tractability of directed multiway cut parameterized by the size of the cutset
cites work: Parameterized Complexity of the Anchored k-Core Problem for Directed Graphs
cites work: Communication and Coordination in Social Networks
cites work: Parameterized Algorithms
cites work: The Complexity of Multiterminal Cuts
cites work: Fundamentals of parameterized complexity
cites work: Parameterized graph separation problems
cites work: Q5284545
cites work: Depth-First Search and Linear Graph Algorithms
DOI: 10.1016/J.IC.2015.11.002
description: scientific article; zbMATH DE number 6553690