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
{"_id":"HCa3w54YhAeyGvo6A","bibbaseid":"klobas-mertzios-molter-spirakis-thecomplexityofcomputingoptimumlabelingsfortemporalconnectivity-2022","author_short":["Klobas, N.","Mertzios, G. B.","Molter, H.","Spirakis, P. G."],"bibdata":{"bibtype":"inproceedings","type":"inproceedings","author":[{"firstnames":["Nina"],"propositions":[],"lastnames":["Klobas"],"suffixes":[]},{"firstnames":["George","B."],"propositions":[],"lastnames":["Mertzios"],"suffixes":[]},{"firstnames":["Hendrik"],"propositions":[],"lastnames":["Molter"],"suffixes":[]},{"firstnames":["Paul","G."],"propositions":[],"lastnames":["Spirakis"],"suffixes":[]}],"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","bibtex":"@inproceedings{KlobasMMS22,\n author = {Nina Klobas and\n George B. Mertzios and\n Hendrik Molter and\n Paul G. Spirakis},\n title = {The Complexity of Computing Optimum Labelings for Temporal Connectivity},\n booktitle = {Proceedings of the 47th International Symposium on Mathematical Foundations of Computer\n Science (MFCS)},\n pages = {62:1--62:15},\n year = {2022},\n}\n\n","author_short":["Klobas, N.","Mertzios, G. B.","Molter, H.","Spirakis, P. G."],"key":"KlobasMMS22","id":"KlobasMMS22","bibbaseid":"klobas-mertzios-molter-spirakis-thecomplexityofcomputingoptimumlabelingsfortemporalconnectivity-2022","role":"author","urls":{},"metadata":{"authorlinks":{}},"html":""},"bibtype":"inproceedings","biburl":"https://bibbase.org/network/files/BZWfBuZY3E6mypcu8","dataSources":["5GsqcumS3vErfsixj"],"keywords":[],"search_terms":["complexity","computing","optimum","labelings","temporal","connectivity","klobas","mertzios","molter","spirakis"],"title":"The Complexity of Computing Optimum Labelings for Temporal Connectivity","year":2022}