Institutional Repository

Browsing University of Lethbridge Theses by Author "Gaur, Daya"

DSpace/Manakin Repository

Browsing University of Lethbridge Theses by Author "Gaur, Daya"

Sort by: Order: Results:

  • Choudhury, Salimur Rashid; University of Lethbridge. Faculty of Arts and Science (Lethbridge, Alta. : University of Lethbridge, Deptartment of Mathematics and Computer Science, 2008Arts and ScienceMathematics and Computer Science, 2008)
    Clusters in protein interaction networks can potentially help identify functional relationships among proteins. We study the clustering problem by modeling it as graph cut problems. Given an edge weighted graph, the goal ...
  • Islam, Mohammad Tauhidul; University of Lethbridge. Faculty of Arts and Science (Lethbridge, Alta. : University of Lethbridge, Dept. of Mathematics and Computer Science, c2009Arts and ScienceDepartment of Mathematics and Computer Science, 2009)
    Knapsack problem has been widely studied in computer science for years. There exist several variants of the problem, with zero-one maximum knapsack in one dimension being the simplest one. In this thesis we study ...
  • Nickle, Elspeth J.; University of Lethbridge. Faculty of Arts and Science (Lethbridge, Alta. : University of Lethbridge, Faculty of Arts and Science, 2005Faculty of Arts and ScienceDepartment of Mathematics and Computer Science, 2005)
    A 3D arrangement graph G is the abstract graph induced by an arrangement of planes in general position where the intersection of any two planes forms a line of intersection and an intersection of three planes creates a ...
  • Haque, Sardar Anisul; University of Lethbridge. Faculty of Arts and Science (Lethbridge, Alta. : University of Lethbridge, Deptartment of Mathematics and Computer Science, 2008Arts and ScienceMathematics and Computer Science, 2008)
    The efficiency of linear algebra operations for sparse matrices on modern high performance computing system is often constrained by the available memory bandwidth. We are interested in sparse matrices whose sparsity ...
  • Bhattacharjee, Sangita; University of Lethbridge. Faculty of Arts and Science (Lethbridge, Alta. : University of Lethbridge, Dept. of Mathematics and Computer Science, 2010Arts and ScienceDepartment of Mathematics and Computer Science, 2010)
    In this thesis, we study a variant of the maximum cardinality matching problem known as the maximum charge problem. Given a graph with arbitrary positive integer capacities assigned on every vertex and every edge, the ...
  • Sabbir, Tarikul Alam Khan (Lethbridge, Alta. : University of Lethbridge, Dept. of Mathematics and Computer Science, c2011Arts and ScienceDepartment of Mathematics and Computer Science, 2011)
    Solving NP-hard facility location problems in wireless network planning is a common scenario. In our research, we study the Covering problem, a well known facility location problem with applications in wireless network ...

Search DSpace


Advanced Search

Browse

My Account

Statistics