Incremental problems in the parameterized complexity setting
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1507224 (Why is no real title available?)
- Applying modular decomposition to parameterized cluster editing problems
- Complexity models for incremental computation
- Dynamic complexity theory revisited
- Fast algorithms for determining (generalized) core groups in social networks
- On the computational complexity of dynamic graph problems
- On the parameterised complexity of string morphism problems
- Optimal decremental connectivity in planar graphs
- Parameterized complexity of Vertex Cover variants
- Parametrized complexity theory.
- The parameterized complexity of editing graphs for bounded degeneracy
- Topology-oriented incremental computation of Voronoi diagrams of circular arcs and straight-line segments
Cited in
(3)
This page was built for publication: Incremental problems in the parameterized complexity setting
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q519883)