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

Stable structure on safe set problems in vertex-weighted graphs. II: Recognition and complexity

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

DOI10.1007/978-3-030-60440-0_29OpenAlexW3097293378MaRDI QIDQ2110639

Shinya Fujita, Boram Park, Tadashi Sakuma

Publication date: 21 December 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-60440-0_29


zbMATH Keywords

safe setnetwork vulnerabilityconnected safe setnetwork majoritysafe-finitesubgraph component polynomialvertex-weight function


Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)


Related Items (1)

A combinatorial branch and bound for the safe set problem




This page was built for publication: Stable structure on safe set problems in vertex-weighted graphs. II: Recognition and complexity

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