Login / Signup

Fixed-Parameter Tractable Certified Algorithms for Covering and Dominating in Planar Graphs and Beyond.

Benjamin Merlin BumpusBart M. P. JansenJaime Venne
Published in: SWAT (2024)
Keyphrases
  • planar graphs
  • learning algorithm
  • computational complexity
  • worst case
  • binary images
  • approximation algorithms
  • computational problems
  • fixed parameter tractable