Shao, S., & Zivny, S. (2023). A strongly polynomial-time algorithm for weighted general factors with three feasible degrees. Schloss-Dagstuhl - Leibniz Zentrum für Informatik.
Chicago Style (17. basım) AtıfShao, S., ve S. Zivny. A Strongly Polynomial-time Algorithm for Weighted General Factors with Three Feasible Degrees. Schloss-Dagstuhl - Leibniz Zentrum für Informatik, 2023.
MLA (9th ed.) AtıfShao, S., ve S. Zivny. A Strongly Polynomial-time Algorithm for Weighted General Factors with Three Feasible Degrees. Schloss-Dagstuhl - Leibniz Zentrum für Informatik, 2023.
Uyarı: Bu alıntı herzaman %100 doğru olmayabilir..