Aug 19, 2016 · Our new tools allow us to obtain for every fixed value of r a polynomial kernel for the distance-r dominating set problem on nowhere dense ...
Our new tools allow us to obtain for every fixed radius r ∈ N a polynomial kernel for the distance-r dominating set problem on nowhere dense classes of graphs.
Abstract. Nowhere dense classes of graphs [24, 25] are very general classes of uniformly sparse graphs with several seemingly unrelated characterisations.
Sep 5, 2018 · Abstract. Nowhere dense classes of graphs [24, 25] are very general classes of uniformly sparse graphs with several seemingly unrelated ...
Nowhere dense classes of graphs [21, 22] are very general classes of uniformly sparse graphs with several seemingly unrelated characterisations.
Bibliographic details on Polynomial Kernels and Wideness Properties of Nowhere Dense Graph Classes.
Aug 24, 2016 · Nowhere dense classes of graphs are very general classes of uniformly sparse graphs with several seemingly unrelated characterisations.
People also ask
What is nowhere dense class of graphs?
What are the properties of dense graphs?
Nov 19, 2022 · Connected Papers is a visual tool to help researchers and applied scientists find academic papers relevant to their field of work.
Polynomial kernels and wideness properties of nowhere dense graph classes. ACM Transactions on Algorithms (TALG), Volume 15 Issue 2, 2018. Available online ...
Oct 2, 2019 · In this paper we establish a new characterization of nowhere dense classes, in terms of poset dimension: A monotone graph class is nowhere dense ...