The Complexity of Computing Optimum Labelings for Temporal Connectivity. Klobas, N., Mertzios, G. B., Molter, H., & Spirakis, P. G. In Proceedings of the 47th International Symposium on Mathematical Foundations of Computer Science (MFCS), pages 62:1–62:15, 2022.
bibtex   
@inproceedings{KlobasMMS22,
  author    = {Nina Klobas and
               George B. Mertzios and
               Hendrik Molter and
               Paul G. Spirakis},
  title     = {The Complexity of Computing Optimum Labelings for Temporal Connectivity},
  booktitle = {Proceedings of the 47th International Symposium on Mathematical Foundations of Computer
               Science (MFCS)},
  pages     = {62:1--62:15},
  year      = {2022},
}

Downloads: 0