Back to search
CSUniversity San Bernardino
The embedding of complete bipartite graphs onto grids with a minimum grid cutwidth
Abstract
dc:description.abstractAlgorithms will be domonstrated for how to embed complete bipartite graphs onto 2xn type grids, where the imimum grid cutwidth is attained.
Degree
thesis:*- Name thesis:degree_name
- Master of Arts in Mathematics
- Level thesis:degree_level
- Thesis
- Discipline thesis:degree_discipline
- Mathematics
Author and committee
dc:creator, dc:contributor.*- Author dc:creator
-
- Rocha, Mário
Subjects
dc:subject × 6Identifiers
dc:identifier.*- Repository record dc:identifier
- https://scholarworks.lib.csusb.edu/etd-project/2311