F. Nuriyeva, "Algorithm for Circuit Covering the Euclidean Complete Graph," In Information Technologies and Their Applications. ITTA 2024. Communications in Computer and Information Science. vol 2225. , Bern: Springer Nature Switzerland Ag, 2024, pp.260-274.
Nuriyeva, F. Algorithm for Circuit Covering the Euclidean Complete Graph. 2024. In Information Technologies and Their Applications. ITTA 2024. Communications in Computer and Information Science. vol 2225. , Springer Nature Switzerland Ag, Bern, 260-274.
Nuriyeva, F., (2024). Algorithm for Circuit Covering the Euclidean Complete Graph. Information Technologies and Their Applications. ITTA 2024. Communications in Computer and Information Science. vol 2225. (pp.260-274), Bern: Springer Nature Switzerland Ag.
Nuriyeva, FİDAN. "Algorithm for Circuit Covering the Euclidean Complete Graph." In Information Technologies and Their Applications. ITTA 2024. Communications in Computer and Information Science. vol 2225. , 260-274. Bern: Springer Nature Switzerland Ag, 2024
Nuriyeva, FİDAN. "Algorithm for Circuit Covering the Euclidean Complete Graph." Information Technologies and Their Applications. ITTA 2024. Communications in Computer and Information Science. vol 2225. , Springer Nature Switzerland Ag, 2024, pp.260-274.
Nuriyeva, F. (2024) "Algorithm for Circuit Covering the Euclidean Complete Graph", Information Technologies and Their Applications. ITTA 2024. Communications in Computer and Information Science. vol 2225. . Bern: Springer Nature Switzerland Ag.
@bookchapter{bookchapter, author ={FİDAN NURİYEVA}, chaptertitle={Algorithm for Circuit Covering the Euclidean Complete Graph}, booktitle={ Information Technologies and Their Applications. ITTA 2024. Communications in Computer and Information Science. vol 2225. }, publisher={Springer Nature Switzerland Ag}, city={Bern},year={2024} }