Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 2 of 2 for “"Flip Graph"”.

  1. Combinatorial complexes associated to surfaces

    Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2023-09-01 without embargo terms

    uiuc Repository record for Combinatorial complexes associated to surfaces (opens in a new tab)

  2. Improving the smoothed complexity of flip for max cut problems

    … to finding such a locally optimum solution is the FLIP method. Even though FLIP requires exponential time in worst-case instances, it tends to terminate quickly in practical instances. To explain this discrepancy, the run-time of FLIP has been studied in the smoothed complexity framework. Etscheid …

    uiuc Repository record for Improving the smoothed complexity of flip for max cut problems (opens in a new tab)