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

DOI10.4230/LIPICS.FSTTCS.2013.79zbMATH Open1359.68124OpenAlexW2283038792MaRDI QIDQ2963899FDOQ2963899

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

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?

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)

Cited In (5)

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

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)