Hellmuth, M., & Scholz, G. E. (2023). Solving NP-hard Problems on \textsc{GaTEx} Graphs: Linear-Time Algorithms for Perfect Orderings, Cliques, Colorings, and Independent Sets.
Citazione stile Chigago Style (17a edizione)Hellmuth, Marc, e Guillaume E. Scholz. Solving NP-hard Problems on \textsc{GaTEx} Graphs: Linear-Time Algorithms for Perfect Orderings, Cliques, Colorings, and Independent Sets. 2023.
Citatione MLA (9a ed.)Hellmuth, Marc, e Guillaume E. Scholz. Solving NP-hard Problems on \textsc{GaTEx} Graphs: Linear-Time Algorithms for Perfect Orderings, Cliques, Colorings, and Independent Sets. 2023.
Attenzione: Queste citazioni potrebbero non essere precise al 100%.