Citáce podľa APA (7th ed.)

Kurita, K., & Wasa, K. (2024). An approximation algorithm for K-best enumeration of minimal connected edge dominating sets with cardinality constraints. Theoretical computer science, 1005, 114628. https://doi.org/10.1016/j.tcs.2024.114628

Citácia podle Chicago (17th ed.)

Kurita, Kazuhiro, a Kunihiro Wasa. "An Approximation Algorithm for K-best Enumeration of Minimal Connected Edge Dominating Sets with Cardinality Constraints." Theoretical Computer Science 1005 (2024): 114628. https://doi.org/10.1016/j.tcs.2024.114628.

Citácia podľa MLA (8th ed.)

Kurita, Kazuhiro, a Kunihiro Wasa. "An Approximation Algorithm for K-best Enumeration of Minimal Connected Edge Dominating Sets with Cardinality Constraints." Theoretical Computer Science, vol. 1005, 2024, p. 114628, https://doi.org/10.1016/j.tcs.2024.114628.

Upozornenie: Tieto citáce sú generované automaticky. Nemusia byť úplne správne podľa citačných pravidiel..