Citace podle APA (7th ed.)

Hellmuth, M., & Scholz, G. E. (2025). Solving NP-hard problems on GaTEx graphs: Linear-time algorithms for perfect orderings, cliques, colorings, and independent sets. Theoretical computer science, 1037, 115157. https://doi.org/10.1016/j.tcs.2025.115157

Citace podle Chicago (17th ed.)

Hellmuth, Marc, a Guillaume E. Scholz. "Solving NP-hard Problems on GaTEx Graphs: Linear-time Algorithms for Perfect Orderings, Cliques, Colorings, and Independent Sets." Theoretical Computer Science 1037 (2025): 115157. https://doi.org/10.1016/j.tcs.2025.115157.

Citace podle MLA (9th ed.)

Hellmuth, Marc, a Guillaume E. Scholz. "Solving NP-hard Problems on GaTEx Graphs: Linear-time Algorithms for Perfect Orderings, Cliques, Colorings, and Independent Sets." Theoretical Computer Science, vol. 1037, 2025, p. 115157, https://doi.org/10.1016/j.tcs.2025.115157.

Upozornění: Tyto citace jsou generovány automaticky. Nemusí být zcela správně podle citačních pravidel..