Safe sets, network majority on weighted trees

DOI10.1002/NET.21794MaRDI QIDQ5228508zbMATH OpenOpenAlexFDO

Authors Shinya Fujita, Sylvain Legay, Tadashi Sakuma, Zsolt Tuza, R. B. Bapat, Y. Manoussakis, Yasuko Matsui

Publication date 12 August 2019

Published in Networks (Search for Journal in Brave)

Full work available at URL http://real.mtak.hu/89922/1/net.21794.pdf

zbMATH Keywords

\(\mathcal{NP}\)-completenessapproximation algorithmcentroidnetwork majoritysafe setweighted tree

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Programming involving graphs or networks (90C35) Dynamic programming (90C39)

Recommendations

• Network majority on tree topological network
• Approximating connected safe sets in weighted trees
• On the weighted safe set problem on paths and cycles
• Models and algorithms for the weighted safe set problem
• A new formulation for the safe set problem on graphs

Cited in

(14)

• Safe number and integrity of graphs
• On the connected safe number of some classes of graphs
• Approximating connected safe sets in weighted trees
• Stable structure on safe set problems in vertex-weighted graphs
• A compact mixed integer linear formulation for safe set problems
• A new formulation for the safe set problem on graphs
• On the weighted safe set problem on paths and cycles
• The connected critical node problem
• Models and algorithms for the weighted safe set problem
• Network majority on tree topological network
• Parameterized complexity of safe set
• Constructive-destructive heuristics for the safe set problem
• Safe sets and in-dominating sets in digraphs
• Estimation of domination number of graphs via safe number

This page was built for publication: Safe sets, network majority on weighted trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5228508)