2026-09-19T20:26:50Zhttps://dspace.mit.edu/server/oai/requestoai:dspace.mit.edu:1721.1/1391122022-01-15T03:40:22Zcom_1721.1_7582com_1721.1_7581col_1721.1_131023
Williams, Virginia Vassilevska
Bathe, Mark
Sheridan, Kristin
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
2022-01-14T14:50:42Z
2022-01-14T14:50:42Z
2021-06
2021-06-17T20:14:22.143Z
https://hdl.handle.net/1721.1/139112
In many contexts, it is useful to determine if a particular distance metric can be broken down into other metrics about which more is known. In particular, if a metric can be embedded into a hypercube, the plethora of preexisting knowledge about the structure of a hypercube can provide knowledge about the structure in question. In this paper, we examine the concepts of graph factorization and pseudofactorization, in which a graph is broken up into smaller graphs whose Cartesian product it is isomorphic to or is an isometric subgraph of, respectively. We show that the same or slightly modified versions of the techniques used for this process in the context of unweighted graphs also work for weighted graphs. While it is NP-hard to decide if a general distance metric is hypercube embeddable, we also discuss how these results expand the number of known types of graphs and distance metrics for which this problem is polynomial time decidable. We also discuss why this kind of decomposition of graphs and distance metrics may be of interest in a variety of fields.
M.Eng.
Massachusetts Institute of Technology
In Copyright - Educational Use Permitted
Copyright MIT
http://rightsstatements.org/page/InC-EDU/1.0/
Graph factorization and pseudofactorization with applications to hypercube embeddings
Thesis
application/pdf
Master
Master of Engineering in Electrical Engineering and Computer Science
Publication
unknown
unknown
<Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="66543ec5-c1f3-4999-832b-37fb3892eb30">
<Type xmlns="https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types">http://purl.org/coar/resource_type/c_1843</Type>
<Title>Graph factorization and pseudofactorization with applications to hypercube embeddings</Title>
<PublishedIn>
<Publication>
</Publication>
</PublishedIn>
<PublicationDate>2021-06</PublicationDate>
<Authors>
<Author>
<DisplayName>Sheridan, Kristin</DisplayName>
<Affiliation>
<OrgUnit>
</OrgUnit>
</Affiliation>
</Author>
</Authors>
<Editors>
</Editors>
<Publishers>
<Publisher>
<DisplayName>Massachusetts Institute of Technology</DisplayName>
<OrgUnit />
</Publisher>
</Publishers>
<License>http://rightsstatements.org/page/InC-EDU/1.0/</License>
<Abstract>In many contexts, it is useful to determine if a particular distance metric can be broken down into other metrics about which more is known. In particular, if a metric can be embedded into a hypercube, the plethora of preexisting knowledge about the structure of a hypercube can provide knowledge about the structure in question. In this paper, we examine the concepts of graph factorization and pseudofactorization, in which a graph is broken up into smaller graphs whose Cartesian product it is isomorphic to or is an isometric subgraph of, respectively. We show that the same or slightly modified versions of the techniques used for this process in the context of unweighted graphs also work for weighted graphs. While it is NP-hard to decide if a general distance metric is hypercube embeddable, we also discuss how these results expand the number of known types of graphs and distance metrics for which this problem is polynomial time decidable. We also discuss why this kind of decomposition of graphs and distance metrics may be of interest in a variety of fields.</Abstract>
<Access xmlns="http://purl.org/coar/access_right"
>
</Access>
</Publication>