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 5 of 5 for “"Mathematics Graphic methods"”.

  1. A Graph Convolutional Network approach for enhancing Set Covering Problem solvers

    The Set Covering Problem (SCP) is an NP-hard combinatorial optimization problem with applications in telecommunication, logistics, and transportation. Solving SCP is computationally challenging due to the combinatorial explosion of potential solutions, particularly for large instances. This study …

    utc Repository record for A Graph Convolutional Network approach for enhancing Set Covering Problem solvers (opens in a new tab)

  2. Snort: A combinatorial game

    This paper focuses on the game Snort, which is a combinatorial game on graphs. This paper will explore the characteristics of opposability through examples. More fully, we obtain some neccessary conditions for a graph to be opposable. Since an opposable graph guarantees a second player win, we …

    csusb Repository record for Snort: A combinatorial game (opens in a new tab)

  3. Snort: A combinatorial game

    This paper focuses on the game Snort, which is a combinatorial game on graphs. This paper will explore the characteristics of opposability through examples. More fully, we obtain some neccessary conditions for a graph to be opposable. Since an opposable graph guarantees a second player win, we …

    csusb-retro Repository record for Snort: A combinatorial game (opens in a new tab)

  4. Distance preserving graphs

    "The computational complexity of exploring distance properties of large graphs such as real-world social networks which consist of millions of nodes is extremely expensive. Recomputing distances in subgraphs of the original graph will add to the cost. One way to avoid this is to use subgraphs where …

    msu Repository record for Distance preserving graphs (opens in a new tab)