scientific article; zbMATH DE number 7378593
From MaRDI portal
Publication:5009469
DOI10.4230/LIPIcs.IPEC.2018.7zbMath1503.68228arXiv1805.12453MaRDI QIDQ5009469
Ondřej Suchý, Hendrik Molter, Jun-Jie Luo
Publication date: 4 August 2021
Full work available at URL: https://arxiv.org/abs/1805.12453
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
graph algorithmsfeedback vertex setfixed-parameter tractabilitysocial network analysis\(r\)-degenerate vertex deletionkernelization lower bounds
Social networks; opinion dynamics (91D30) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Parameterized complexity, tractability and kernelization (68Q27)
Related Items (3)
A parameterized complexity view on collapsing \(k\)-cores ⋮ Minimization and parameterized variants of vertex partition problems on graphs ⋮ Unnamed Item
Cites Work
- Parameterized complexity of the anchored \(k\)-core problem for directed graphs
- On feedback vertex set: new measure and new structures
- Clustering and community detection in directed networks: a survey
- Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization
- The parameterized complexity of editing graphs for bounded degeneracy
- On the nonseparating independent set problem and feedback set problem for graphs with no vertex degree exceeding three
- Treewidth. Computations and approximations
- Fixed-parameter tractability and completeness. IV: On completeness for W\([\) P\(\) and PSPACE analogues]
- Faster deterministic \textsc{Feedback Vertex Set}
- A $c^k n$ 5-Approximation Algorithm for Treewidth
- Preventing Unraveling in Social Networks: The Anchored k-Core Problem
- Linear Time Parameterized Algorithms for Subset Feedback Vertex Set
- Kernelization Lower Bounds by Cross-Composition
- A naive algorithm for feedback vertex set
- Parameterized Algorithms
- Unnamed Item
- Unnamed Item
This page was built for publication:
