Laštovička, P., & Legerský, J. (2024). Flexible realizations existence: NP-completeness on sparse graphs and algorithms.
Citazione stile Chigago Style (17a edizione)Laštovička, Petr, e Jan Legerský. Flexible Realizations Existence: NP-completeness on Sparse Graphs and Algorithms. 2024.
Citatione MLA (9a ed.)Laštovička, Petr, e Jan Legerský. Flexible Realizations Existence: NP-completeness on Sparse Graphs and Algorithms. 2024.
Attenzione: Queste citazioni potrebbero non essere precise al 100%.