FPT algorithms for domination in biclique-free graphs
DOI10.1007/978-3-642-33090-2_69zbMATH Open1365.68291OpenAlexW57303768MaRDI QIDQ2912896FDOQ2912896
Authors: Jan Arne Telle, Yngve Villanger 
Publication date: 25 September 2012
Published in: Algorithms – ESA 2012 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-33090-2_69
Recommendations
Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cited In (19)
- On the parameterized complexity of \([1,j]\)-domination problems
- Grundy Coloring and friends, half-graphs, bicliques
- Greedy domination on biclique-free graphs
- Lossy kernels for connected dominating set on sparse graphs
- Exploiting c-Closure in Kernelization Algorithms for Graph Problems
- On finding short reconfiguration sequences between independent sets
- FPT algorithms to compute the elimination distance to bipartite graphs and more
- Exploiting \(c\)-closure in kernelization algorithms for graph problems
- On the Parameterized Complexity of [1,j]-Domination Problems
- A closer look at Hamiltonicity and domination through the lens of diameter and convexity
- FPT algorithms for domination in sparse graphs and beyond
- Conflict free feedback vertex set: a parameterized dichotomy
- Dominating set is fixed parameter tractable in claw-free graphs
- FPT Algorithms for Path-Transversals and Cycle-Transversals Problems in Graphs
- k-Efficient domination: Algorithmic perspective
- Domination when the stars are out
- Title not available (Why is that?)
- Impact of diameter and convex ordering for Hamiltonicity and domination
- Reconfiguration on sparse graphs
This page was built for publication: FPT algorithms for domination in biclique-free graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2912896)
