A tight local algorithm for the minimum dominating set problem in
  outerplanar graphs
v1v2 (latest)

A tight local algorithm for the minimum dominating set problem in outerplanar graphs

Papers citing "A tight local algorithm for the minimum dominating set problem in outerplanar graphs"

1 / 1 papers shown

We use cookies and other tracking technologies to improve your browsing experience on our website, to show you personalized content and targeted ads, to analyze our website traffic, and to understand where our visitors are coming from. See our policy.