Building large k-cores from sparse graphs
From MaRDI portal
Publication:5089202
Recommendations
Cites work
- scientific article; zbMATH DE number 3169205 (Why is no real title available?)
- A note on a theorem of Erdős and Gallai
- A parameterized complexity view on collapsing \(k\)-cores
- An application of simultaneous diophantine approximation in combinatorial optimization
- Can we create large \(k\)-cores by adding few edges?
- Communication and Coordination in Social Networks
- Editing graphs to satisfy degree constraints: a parameterized approach
- Editing to a connected graph of given degrees
- Editing to connected \(f\)-degree graph
- Finding even subgraphs even faster
- Graph theory
- Integer Programming with a Fixed Number of Variables
- Kernelization lower bounds through colors and IDs
- Minkowski's Convex Body Theorem and Integer Programming
- Parameterized algorithms
- 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
- Tight lower bounds on the matching number in a graph with given maximum degree
- Understanding edge connectivity in the Internet through core decomposition
- \(k\)-core decomposition of internet graphs: hierarchies, self-similarity and measurement biases
Cited in
(5)- Targeted \(k\)-node collapse problem: towards understanding the robustness of local \(k\)-core structure
- Hierarchical cycle-tree packing model for optimal \(K\)-core attack
- Can we create large \(k\)-cores by adding few edges?
- Minimum k‐cores and the k‐core polytope
- Building large \(k\)-cores from sparse graphs
This page was built for publication: Building large \(k\)-cores from sparse graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5089202)
