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

Complexity results for $k$-domination and $\alpha$-domination problems and their variants

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

zbMath1463.05394arXiv1702.00533MaRDI QIDQ5206327

Mohammad Farshi, Mahdieh Hasheminezhad, Davood Bakhshesh

Publication date: 18 December 2019

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


zbMATH Keywords

approximation\(f\)-domination\(k\)-domination\(\alpha\)-domination


Mathematics Subject Classification ID

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


Related Items (1)

Domination and convexity problems in the target set selection model







This page was built for publication: Complexity results for $k$-domination and $\alpha$-domination problems and their variants

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