Publication:5136273
From MaRDI portal
DOI10.4230/LIPIcs.ISAAC.2017.53zbMath1457.05098MaRDI QIDQ5136273
Charis Papadopoulos, Athanasios L. Konstantinidis
Publication date: 25 November 2020
NP-completeness; polynomial-time algorithm; split graphs; proper interval graphs; strong triadic closure
91D30: Social networks; opinion dynamics
05C75: Structural characterization of families of graphs
05C78: Graph labelling (graceful graphs, bandwidth, etc.)
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
05C85: Graph algorithms (graph-theoretic aspects)
05C62: Graph representations (geometric and intersection representations, etc.)
