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

From MaRDI portal

Revision as of 22:29, 1 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

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 set network vulnerability connected safe set network majority safe-finite subgraph component polynomial vertex-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"