American Psychological Association 6th edition

Vasilchikov, V. V. (2024). Recursive-Parallel Algorithm for Solving the Maximum Common Subgraph Problem. Automatic Control and Computer Sciences, 58(7), 827-835. https://doi.org/10.3103/s0146411624700287

ISO-690 (author-date, English)

VASILCHIKOV, V. V., 2024. Recursive-Parallel Algorithm for Solving the Maximum Common Subgraph Problem. Automatic Control and Computer Sciences. 1 Dezember 2024. Vol. 58, no. 7, p. 827-835. DOI 10.3103/s0146411624700287.

Modern Language Association 9th edition

Vasilchikov, V. V. „Recursive-Parallel Algorithm for Solving the Maximum Common Subgraph Problem“. Automatic Control and Computer Sciences, Bd. 58, Nr. 7, Dezember 2024, S. 827-35, https://doi.org/10.3103/s0146411624700287.

Mohr Siebeck - Recht (Deutsch - Österreich)

Vasilchikov, V. V.: Recursive-Parallel Algorithm for Solving the Maximum Common Subgraph Problem, Automatic Control and Computer Sciences 2024, 827-835.

Emerald - Harvard

Vasilchikov, V.V. (2024), „Recursive-Parallel Algorithm for Solving the Maximum Common Subgraph Problem“, Automatic Control and Computer Sciences, Vol. 58 No. 7, S. 827-835.

Achtung: Diese Zitate sind unter Umständen nicht zu 100% korrekt.