On the weighted safe set problem on paths and cycles

DOI10.1007/s10878-018-0316-4zbMath1423.90261arXiv1802.03579OpenAlexW2963756682WikidataQ129715135 ScholiaQ129715135MaRDI QIDQ2420660

Tommy R. Jensen, Shinya Fujita, Boram Park, Tadashi Sakuma

Publication date: 6 June 2019

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

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

zbMATH Keywords

weighted graphsafe setconnected safe setsafe-finitesubgraph component polynomial

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Related Items (6)

Approximating connected safe sets in weighted trees ⋮ Safe sets and in-dominating sets in digraphs ⋮ Parameterized Complexity of Safe Set ⋮ Stable structure on safe set problems in vertex-weighted graphs ⋮ On the connected safe number of some classes of graphs ⋮ Unnamed Item

Cites Work

• Safe set problem on graphs
• Network majority on tree topological network
• The enumeration of vertex induced subgraphs with respect to the number of components
• Safe sets in graphs: graph classes and structural parameters
• Approximating connected safe sets in weighted trees
• Unnamed Item

This page was built for publication: On the weighted safe set problem on paths and cycles