Dobbs, K. W., King, D. M., & Jacobson, S. H. (2026). Finding Shortest Flip Sequences Between Connected Graph Partitions. INFORMS Journal on Optimization, 8(2), 163. https://doi.org/10.1287/ijoo.2024.0050
Chicago Style (17th ed.) CitationDobbs, Kiera W., Douglas M. King, and Sheldon H. Jacobson. "Finding Shortest Flip Sequences Between Connected Graph Partitions." INFORMS Journal on Optimization 8, no. 2 (2026): 163. https://doi.org/10.1287/ijoo.2024.0050.
MLA (9th ed.) CitationDobbs, Kiera W., et al. "Finding Shortest Flip Sequences Between Connected Graph Partitions." INFORMS Journal on Optimization, vol. 8, no. 2, 2026, p. 163, https://doi.org/10.1287/ijoo.2024.0050.
Warning: These citations may not always be 100% accurate.