Found 2 document(s)
Page 1 of 1
-
We study distributed approximation of Minimum Dominating Set in a very general class of sparse graphs, extending near-optimal approximation results from the minor-free setting to bounded expansion. In more detail, for fi...
-
We exhibit a new obstacle to the nascent algorithmic theory for classes excluding an induced minor. We indeed show that on the class of string graphs-which avoids the 1-subdivision of, say, K5 as an induced minor-Induced...