Lossy Kernels for Connected Dominating Set on Sparse Graphs (Q5234662): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Created claim: Wikidata QID (P12): Q127201832, #quickstatements; #temporary_batch_1722805341585
 
(4 intermediate revisions by 4 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial-time data reduction for dominating set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear time algorithms for finding a dominating set of fixed size in degenerated graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fourier meets M\"{o}bius: fast subset convolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: (Meta) Kernelization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Classes: A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: From Gap-Exponential Time Hypothesis to Fixed Parameter Tractable Inapproximability: Clique, Dominating Set, and More / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight Kernel Bounds for Problems on Graphs with Small Degeneracy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Domination Problems in Nowhere-Dense Classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4503944 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fundamentals of parameterized complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kernelization and Sparseness: the case of Dominating Set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constant-factor approximation of the domination number in sparse graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Neighborhood complexity and kernelization for nowhere dense classes of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5090476 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bidimensionality and Geometric Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5743379 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2957874 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kernelization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kernelization using structural parameters on sparse graph classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Colouring and Covering Nowhere Dense Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deciding First-Order Properties of Nowhere Dense Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Algorithms for Polynomial-Expansion and Low-Density Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the parameterized complexity of approximating dominating set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Orderings on graphs and game coloring number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Kernels and Single-Exponential Algorithms Via Protrusion Decompositions / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Generalised Colouring Numbers on Classes of Bounded Expansion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial Kernels and Wideness Properties of Nowhere Dense Graph Classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear kernel for a planar connected dominating set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reconfiguration on sparse graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lossy kernelization / rank
 
Normal rank
Property / cites work
 
Property / cites work: FPT Algorithms for Connected Feedback Vertex Set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Grad and classes with bounded expansion. I: Decompositions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Grad and classes with bounded expansion. II: Algorithmic aspects / rank
 
Normal rank
Property / cites work
 
Property / cites work: Grad and classes with bounded expansion. III: Restricted graph homomorphism dualities / rank
 
Normal rank
Property / cites work
 
Property / cites work: First order properties on nowhere dense structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3567810 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On nowhere dense graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparsity. Graphs, structures, and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Dominating Set in Larger Classes of Graphs: FPT Algorithms and Polynomial Kernels / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial kernels for dominating set in graphs of bounded degeneracy and beyond / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the number of types in sparse graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterising bounded expansion by neighbourhood complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the density of families of sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: A combinatorial problem; stability and order for models and theories in infinitary languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: FPT Algorithms for Domination in Biclique-Free Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the generalised colouring numbers of graphs that exclude a fixed minor / rank
 
Normal rank
Property / cites work
 
Property / cites work: Colouring graphs with bounded generalized colouring number / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1137/18m1172508 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2976369687 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q127201832 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 22:09, 4 August 2024

scientific article; zbMATH DE number 7111113
Language Label Description Also known as
English
Lossy Kernels for Connected Dominating Set on Sparse Graphs
scientific article; zbMATH DE number 7111113

    Statements

    Lossy Kernels for Connected Dominating Set on Sparse Graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    30 September 2019
    0 references
    parameterized complexity
    0 references
    lossy kernelization
    0 references
    connected dominating set
    0 references
    sparse graph classes
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references