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 “"maximum k-core"”.

  1. Coloring and degeneracy for determining very large and sparse derivative matrices

    … algorithms. We have introduced degeneracy and maximum k-core for sparse matrices to solve the problem in stages. Our combined approach produce better results in terms of partitioning than DSJM and for some test instances, we report optimal partitioning for the first time.

    lethbridge Repository record for Coloring and degeneracy for determining very large and sparse derivative matrices (opens in a new tab)

  2. Clique Relaxations & the Minority Districting Problem

    … and computational experiments. The Anchored k-core Problem is a variant of the maximum k-core problem, which itself is a relaxation of a clique. We propose an integer programming formulation for the anchored k-core problem, define and study the polyhedra of the maximum anchored k-core problem, …

    rice Repository record for Clique Relaxations & the Minority Districting Problem (opens in a new tab)