Login / Signup
Linear-Time Computation of a Linear Problem Kernel for Dominating Set on Planar Graphs.
René van Bevern
Sepp Hartung
Frank Kammer
Rolf Niedermeier
Mathias Weller
Published in:
IPEC (2011)
Keyphrases
</>
dominating set
planar graphs
facility location problem
connected dominating set
computational complexity
social networks
support vector
approximation algorithms
dynamic systems