Bipartite Graph Packing Problems

Author(s) Information

Collin Christopher Wong, California Polytechnic State University, San Luis ObispoFollow

College - Author 1

College of Engineering

Department - Author 1

Computer Science Department

Degree Name - Author 1

BS in Computer Science

Date

6-2018

Primary Advisor

Theresa Migler-VonDollen, College of Engineering, Computer Science and Software Engineering Department

Abstract/Summary

The overarching problem of this project was trying to find the maximal number of disjoint subgraphs of a certain type we can pack into any graph. These disjoint graphs could be of any type in the original problem. However, they were limited to be T₂ trees for my research (T₂ trees are defined in section 2.1 of the paper). In addition, most of my work was focused on packing these T₂ trees into constrained bipartite graphs (also defined in section 2.1 of the paper).

Even with these specific constraints applied to the overall problem, the project still branched into different subproblems such as packing trees into complete bipartite graphs and finding minimal and maximal bounds for packing these graphs.

URL: https://digitalcommons.calpoly.edu/cscsp/142