Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

scientific article

From MaRDI portal
Publication:2957874
Jump to:navigation, search

DOI10.4230/LIPIcs.STACS.2013.92zbMath1354.68120arXiv1210.0257MaRDI QIDQ2957874

Dimitrios M. Thilikos, Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh

Publication date: 30 January 2017

Full work available at URL: https://arxiv.org/abs/1210.0257

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

dominating setconnected dominating setparameterized complexitykernelizationalgorithmic graph minors


Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph minors (05C83) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)


Related Items (9)

Characterising bounded expansion by neighbourhood complexity ⋮ On kernelization and approximation for the vector connectivity problem ⋮ A linear kernel for planar red-blue dominating set ⋮ On complexities of minus domination ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Lossy Kernels for Connected Dominating Set on Sparse Graphs ⋮ Lossy Kernels for Connected Dominating Set on Sparse Graphs ⋮ On Complexities of Minus Domination




This page was built for publication:

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2957874&oldid=15956739"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 3 February 2024, at 20:18.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki