| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 6876078 | Theoretical Computer Science | 2015 | 19 Pages |
Abstract
Finally, we prove that the problem of maximizing the number of edges that are drawn the same in a SEFEâ
of two graphs (optimization of SEFE) is NP-complete, even in several restricted settings.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Patrizio Angelini, Giordano Da Lozzo, Daniel Neuwirth,