Harmless sets in sparse classes (Q2169963)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Harmless sets in sparse classes	scientific article

Statements

scholarly article

0 references

Harmless sets in sparse classes (English)

0 references

10.1007/978-3-031-06678-8_22

0 references

Pål Grønås Drange

0 references

0 references

0 references

publication date

30 August 2022

0 references

full work available at URL

https://arxiv.org/abs/2111.11834

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

MaRDI profile type

MaRDI publication profile

0 references

0 references

The complexity of finding harmless individuals in social networks

0 references

A $c^k n$ 5-Approximation Algorithm for Treewidth

0 references

On the Approximability of Influence in Social Networks

0 references

Parameterized Algorithms

0 references

0 references

Kernelization and Sparseness: the case of Dominating Set

0 references

Irreversible \(k\)-threshold processes: Graph-theoretical threshold models of the spread of disease and of opinion

0 references

Constant-factor approximation of the domination number in sparse graphs

0 references

0 references

0 references

Contraction Bidimensionality: The Accurate Picture

0 references

On the harmless set problem parameterized by treewidth

0 references

Deciding First-Order Properties of Nowhere Dense Graphs

0 references

0 references

Automata, Languages and Programming

0 references

Polynomial Kernels and Wideness Properties of Nowhere Dense Graph Classes

0 references

Grad and classes with bounded expansion. I: Decompositions

0 references

0 references

Characterising bounded expansion by neighbourhood complexity

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2169963

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2169963&oldid=36848514"