Parameterized complexity of the anchored k-core problem for directed graphs

DOI10.4230/LIPICS.FSTTCS.2013.79MaRDI QIDQ2963899zbMATH OpenOpenAlexFDO

Authors Rajesh Chitnis, Fedor V. Fomin, Petr A. Golovach

Publication date 21 February 2017

Full work available at URL https://dblp.uni-trier.de/db/conf/fsttcs/fsttcs2013.html#ChitnisFG13

zbMATH Keywords

anchored \(k\)-coredirected graphsparameterized complexity

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Recommendations

• Parameterized complexity of the anchored k-core problem for directed graphs
• A parameterized complexity view on collapsing \(k\)-cores
• A parameterized complexity view on collapsing \(k\)-cores
• Preventing unraveling in social networks: the anchored \(k\)-core problem
• Can we create large \(k\)-cores by adding few edges?

Cited in

(5)

• Preventing unraveling in social networks: the anchored \(k\)-core problem
• A parameterized complexity view on collapsing \(k\)-cores
• A parameterized complexity view on collapsing \(k\)-cores
• Preventing unraveling in social networks: the anchored \(k\)-core problem
• Parameterized complexity of the anchored \(k\)-core problem for directed graphs

This page was built for publication: Parameterized complexity of the anchored \(k\)-core problem for directed graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2963899)