pdf-format: |
|
@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 |