FPT algorithms for domination in biclique-free graphs

DOI10.1007/978-3-642-33090-2_69MaRDI QIDQ2912896zbMATH OpenOpenAlexFDO

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

Mathematics Subject Classification ID

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)

Recommendations

• FPT algorithms for domination in sparse graphs and beyond
• Dominating set is fixed parameter tractable in claw-free graphs
• Greedy domination on biclique-free graphs

Cited in

(17)

• Greedy domination on biclique-free graphs
• Exploiting c-Closure in Kernelization Algorithms for Graph Problems
• Grundy Coloring and friends, half-graphs, bicliques
• FPT algorithms to compute the elimination distance to bipartite graphs and more
• Impact of diameter and convex ordering for Hamiltonicity and domination
• Conflict free feedback vertex set: a parameterized dichotomy
• Exploiting \(c\)-closure in kernelization algorithms for graph problems
• Lossy kernels for connected dominating set on sparse graphs
• k-Efficient domination: Algorithmic perspective
• On the parameterized complexity of \([1,j]\)-domination problems
• On the Parameterized Complexity of [1,j]-Domination Problems
• FPT algorithms for domination in sparse graphs and beyond
• FPT Algorithms for Path-Transversals and Cycle-Transversals Problems in Graphs
• A closer look at Hamiltonicity and domination through the lens of diameter and convexity
• Progressive algorithms for domination and independence
• On finding short reconfiguration sequences between independent sets
• Dominating set is fixed parameter tractable in claw-free 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)