APA引文

Akrida, E. C., Gąsieniec, L., Mertzios, G. B., & Spirakis, P. G. (2017). The Complexity of Optimal Design of Temporally Connected Graphs. Theory Comput Syst.

Citação norma Chicago

Akrida, Eleni C., Leszek Gąsieniec, George B. Mertzios, and Paul G. Spirakis. "The Complexity of Optimal Design of Temporally Connected Graphs." Theory Comput Syst 2017.

MLA引文

Akrida, Eleni C., Leszek Gąsieniec, George B. Mertzios, and Paul G. Spirakis. "The Complexity of Optimal Design of Temporally Connected Graphs." Theory Comput Syst 2017.

警告：這些引文格式不一定是100％准確.