Now showing items 1-2 of 2

    • Hardness results and approximation algorithms for some problems on graphs 

      Aazami, Ashkan (University of Waterloo, 2008-12-17)
      This thesis has two parts. In the first part, we study some graph covering problems with a non-local covering rule that allows a "remote" node to be covered by repeatedly applying the covering rule. In the second part, we ...
    • On Schnyder's Theorm 

      Barrera-Cruz, Fidel (University of Waterloo, 2010-08-20)
      The central topic of this thesis is Schnyder's Theorem. Schnyder's Theorem provides a characterization of planar graphs in terms of their poset dimension, as follows: a graph G is planar if and only if the dimension of ...


      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