A parameterized complexity view on collapsing k-cores
From MaRDI portal
Publication:825978
Recommendations
- A parameterized complexity view on collapsing \(k\)-cores
- Can we create large \(k\)-cores by adding few edges?
- Parameterized complexity of the anchored \(k\)-core problem for directed graphs
- Parameterized complexity of the anchored k-core problem for directed graphs
- Multiple Hypernode Hitting Sets and Smallest Two-Cores with Targets
Cites work
- scientific article; zbMATH DE number 6474901 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 7561372 (Why is no real title available?)
- A \(c^k n\) 5-approximation algorithm for treewidth
- A naive algorithm for feedback vertex set
- A parameterized complexity view on collapsing \(k\)-cores
- Can we create large \(k\)-cores by adding few edges?
- Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization
- Constant thresholds can make target set selection tractable
- Fast algorithms for determining (generalized) core groups in social networks
- Faster deterministic \textsc{Feedback Vertex Set}
- Fixed-parameter tractability and completeness. IV: On completeness for W\([\) P\(]\) and PSPACE analogues
- Fundamentals of parameterized complexity
- Immunity against local influence
- Improved analysis of highest-degree branching for feedback vertex set
- Improved upper bounds for vertex cover
- Kernelization Lower Bounds by Cross-Composition
- Linear time parameterized algorithms for \textsc{Subset Feedback Vertex Set}
- Linear time solvable optimization problems on graphs of bounded clique-width
- Linear-time kernelization for feedback vertex set
- Lower bounds based on the exponential time hypothesis
- On feedback vertex set: new measure and new structures
- On the approximability of influence in social networks
- On the nonseparating independent set problem and feedback set problem for graphs with no vertex degree exceeding three
- Parameterized algorithms
- Parameterized complexity of the anchored k-core problem for directed graphs
- Parameterized inapproximability of target set selection and generalizations
- Preventing unraveling in social networks: the anchored \(k\)-core problem
- Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time
- Target set selection parameterized by clique-width and maximum threshold
- The bandwidth problem for graphs and matrices—a survey
- The complexity of finding harmless individuals in social networks
- The parameterized complexity of editing graphs for bounded degeneracy
- Tight bounds for parameterized complexity of cluster editing with a small number of clusters
- Treewidth governs the complexity of target set selection
- Treewidth. Computations and approximations
Cited in
(9)- A parameterized complexity view on collapsing \(k\)-cores
- Targeted \(k\)-node collapse problem: towards understanding the robustness of local \(k\)-core structure
- Parameterized complexity of the anchored k-core problem for directed graphs
- Parameterized complexity of the anchored \(k\)-core problem for directed graphs
- Preventing unraveling in social networks: the anchored \(k\)-core problem
- Mathematical programming formulations for the collapsed k-core problem
- Preventing unraveling in social networks: the anchored \(k\)-core problem
- Building large \(k\)-cores from sparse graphs
- Building large \(k\)-cores from sparse graphs
This page was built for publication: A parameterized complexity view on collapsing \(k\)-cores
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q825978)
