View in EDS HTML Full Text PDF Full Text

Finding Shortest Flip Sequences Between Connected Graph Partitions.

Saved in:
Bibliographic Details
Title: Finding Shortest Flip Sequences Between Connected Graph Partitions.
Authors: Dobbs, Kiera W.1 (AUTHOR) kdobbs2@illinois.edu, King, Douglas M.1 (AUTHOR) dmking@illinois.edu, Jacobson, Sheldon H.2 (AUTHOR) shj@illinois.edu
Source: INFORMS Journal on Optimization. Spring2026, Vol. 8 Issue 2, p163-184. 22p.
Database: Business Source Ultimate
Full text is not displayed to guests.
Description
ISSN:25751484
DOI:10.1287/ijoo.2024.0050