Computing secure sets in graphs using answer set programming

DOI10.1093/LOGCOM/EXV060zbMath1487.68170OpenAlexW2411666486MaRDI QIDQ3304090

Günther Charwat, Bernhard Bliem, Michael Abseher, Stefan Woltran, Frederico Dusberger

Publication date: 5 August 2020

Published in: Journal of Logic and Computation (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/5d7ec2a021562dac3b57397da71490585f802a3b

zbMATH Keywords

secure setsalliances in graphssecurity in graphs

Mathematics Subject Classification ID

Social networks; opinion dynamics (91D30) Graph theory (including graph drawing) in computer science (68R10) Logic programming (68N17)

Uses Software

• Clingo

This page was built for publication: Computing secure sets in graphs using answer set programming