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 “"multi-coloring"”.

  1. On the determination of sparse Hessian matrices using multi-coloring

    … determination problem can be posed as a graph coloring problem. Graph formulation of the problem using an appropriate model can lead to a better exposition of the matrix compression heuristics.

    lethbridge Repository record for On the determination of sparse Hessian matrices using multi-coloring (opens in a new tab)

  2. The Column Multiplicity Problem in Decomposition of Functions and Relations

    Finding the column multiplicity in Functional Decomposition has been known to be one of the most important problems to be solved in the process of functional decomposition of discrete functions. A lot of research has been done in this field with many new heuristics generated to find the column …

    portland-state Repository record for The Column Multiplicity Problem in Decomposition of Functions and Relations (opens in a new tab)