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 “"Bipartite Hypergraphs"”.

  1. Santa Claus, Machine Scheduling and Bipartite Hypergraphs

    … to clarify the discussion. Also discussed are bipartite hypergraphs, which correspond naturally to these problems, including a discussion of Haxell's Theorem for bipartite hypergraphs. Conditions for edge covering in bipartite hypergraphs are introduced and their implications investigated. The …

    waterloo Repository record for Santa Claus, Machine Scheduling and Bipartite Hypergraphs (opens in a new tab)

  2. On Some Hypergraph Coloring Algorithms

    Of a given bipartite graph G = (V, E), it is elementary to construct a bipartition in timeO(|V |+|E|). For a given k-graph H = H(k) with k ≥ 3 fixed, Lovász proved that deciding whether H is bipartite is NP-complete. In this thesis, we consider the average running time of this problem. For that, …

    usf Repository record for On Some Hypergraph Coloring Algorithms (opens in a new tab)