scientific article; zbMATH DE number 1954391
From MaRDI portal
Publication:4415262
zbMath1027.90100MaRDI QIDQ4415262
No author found.
Publication date: 28 July 2003
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2556/25560277.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (9)
Hardness Results for Seeding Complex Contagion with Neighborhoods ⋮ Complexity of majority monopoly and signed domination problems ⋮ Majority vote in social networks ⋮ On the complexity of co-secure dominating set problem ⋮ Alliance free sets in Cartesian product graphs ⋮ Minimum monopoly in regular and tree graphs ⋮ Alliances in graphs of bounded clique-width ⋮ Approximability of open \(k\)-monopoly problems ⋮ Hardness, Approximability, and Exact Algorithms for Vector Domination and Total Vector Domination in Graphs
This page was built for publication:
