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 “"Edmonds-Giles Conjecture"”.

  1. The Edmonds-Giles Conjecture and its Relaxations

    … intersects every directed cut at least once. Edmonds and Giles conjectured for all weighted directed graphs, the minimum weight of a directed cut is equal to the maximum size of a packing of directed joins. Unfortunately, the conjecture is false; a counterexample was first given by Schrijver. …

    waterloo Repository record for The Edmonds-Giles Conjecture and its Relaxations (opens in a new tab)

  2. Packing Directed Joins

    Edmonds and Giles conjectured that the maximum number of directed joins in a packing is equal to the minimum weight of a directed cut, for any weighted directed graph. This is a generalization of Woodall's Conjecture (which is still open). Schrijver found the first known counterexample to the …

    waterloo Repository record for Packing Directed Joins (opens in a new tab)