Now showing items 1-4 of 4

    • The Complexity of Network Design for s-t Eff ective Resistance 

      Chan, Pak Hay (University of Waterloo, 2018-08-23)
      We consider a new problem of designing a network with small $s$-$t$ effective resistance. In this problem, we are given an undirected graph $G=(V,E)$ where each edge $e$ has a cost $c_e$ and a resistance $r_e$, two ...
    • List Coloring Some Classes of 1-Planar Graphs 

      Barr, Sam (University of Waterloo, 2021-12-23)
      In list coloring we are given a graph G and a list assignment for G which assigns to each vertex of G a list of possible colors. We wish to find a coloring of the vertices of G such that each vertex uses a color from its ...
    • Simultaneous Graph Representation Problems 

      Jampani, Krishnam Raju (University of Waterloo, 2011-02-18)
      Many graphs arising in practice can be represented in a concise and intuitive way that conveys their structure. For example: A planar graph can be represented in the plane with points for vertices and non-crossing curves ...
    • Simultaneously Embedding Planar Graphs at Fixed Vertex Locations 

      Gordon, Taylor (University of Waterloo, 2010-05-18)
      We discuss the problem of embedding planar graphs onto the plane with pre-specified vertex locations. In particular, we introduce a method for constructing such an embedding for both the case where the mapping from the ...

      UWSpace

      University of Waterloo Library
      200 University Avenue West
      Waterloo, Ontario, Canada N2L 3G1
      519 888 4883

      All items in UWSpace are protected by copyright, with all rights reserved.

      DSpace software

      Service outages