Creative Commons Attribution 3.0 Unported license (CC-BY 3.0)when quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.ISAAC.2017.53
URN: urn:nbn:de:0030-drops-82113
URL: https://drops.dagstuhl.de/opus/volltexte/2017/8211/
Konstantinidis, Athanasios L. ; Papadopoulos, Charis
Maximizing the Strong Triadic Closure in Split Graphs and Proper Interval Graphs
| pdf-format: |
|
Abstract
In social networks the Strong Triadic Closure is an assignment of the edges with strong or weak labels such that any two vertices that have a common neighbor with a strong edge are adjacent. The problem of maximizing the number of strong edges that satisfy the strong triadic closure was recently shown to be NP-complete for general graphs. Here we initiate the study of graph classes for which the problem is solvable. We show that the problem admits a polynomial-time algorithm for two unrelated classes of graphs: proper interval graphs and trivially-perfect graphs. To complement our result, we show that the problem remains NP-complete on split graphs, and consequently also on chordal graphs. Thus we contribute to define the first border between graph classes on which the problem is polynomially solvable and on which it remains NP-complete.
BibTeX - Entry
@InProceedings{konstantinidis_et_al:LIPIcs:2017:8211,
author = {Athanasios L. Konstantinidis and Charis Papadopoulos},
title = {{Maximizing the Strong Triadic Closure in Split Graphs and Proper Interval Graphs}},
booktitle = {28th International Symposium on Algorithms and Computation (ISAAC 2017)},
pages = {53:1--53:12},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-054-5},
ISSN = {1868-8969},
year = {2017},
volume = {92},
editor = {Yoshio Okamoto and Takeshi Tokuyama},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2017/8211},
URN = {urn:nbn:de:0030-drops-82113},
doi = {10.4230/LIPIcs.ISAAC.2017.53},
annote = {Keywords: strong triadic closure, polynomial-time algorithm, NP-completeness, split graphs, proper interval graphs}
}
| Keywords: | strong triadic closure, polynomial-time algorithm, NP-completeness, split graphs, proper interval graphs | |
| Seminar: | 28th International Symposium on Algorithms and Computation (ISAAC 2017) | |
| Issue date: | 2017 | |
| Date of publication: | 07.12.2017 |
