Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 1 of 1
Full-Text Articles in Engineering
Bipartite Graph Packing Problems, Collin Christopher Wong
Bipartite Graph Packing Problems, Collin Christopher Wong
Computer Science and Software Engineering
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 T2 trees for my research (T2 trees are defined in section 2.1 of the paper). In addition, most of my work was focused on packing these T2 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 …