Max- and Min-neighborhood monopolies

DOI10.1007/S00453-002-0963-8zbMATH Open1016.68057OpenAlexW2943145152MaRDI QIDQ1849375FDOQ1849375

Authors: Kazuhisa Makino, Masafumi Yamashita, Tiko Kameda 

Publication date: 1 December 2002

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-002-0963-8

Recommendations

• scientific article; zbMATH DE number 1617284
• On the monopoly of graphs
• An improved derandomized approximation algorithm for the max-controlled set problem
• A study of monopolies in graphs
• scientific article; zbMATH DE number 1954391

zbMATH Keywords

monopolyweighted matching problems

Mathematics Subject Classification ID

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

Cited In (9)

• Complexity of majority monopoly and signed domination problems
• Title not available (Why is that?)
• The power of small coalitions in graphs
• Immunity against local influence
• Partitioning a graph into monopoly sets
• Near-optimal solutions for the generalized max-controlled set problem
• Title not available (Why is that?)
• An improved derandomized approximation algorithm for the max-controlled set problem
• The Generalized Max-Controlled Set Problem

This page was built for publication: Max- and Min-neighborhood monopolies

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