Now showing items 1-1 of 1

    • On Reconfiguration Problems: Structure and Tractability 

      Mouawad, Amer (University of Waterloo, 2015-02-18)
      Given an n-vertex graph G and two vertices s and t in G, determining whether there exists a path and computing the length of the shortest path between s and t are two of the most fundamental graph problems. In the classical ...


      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