Factorization and pseudofactorization of weighted graphs

Kristin Sheridan, Joseph Berleant, Mark Bathe +2

For unweighted graphs, finding isometric embeddings is closely related to decompositions of $G$ into Cartesian products of smaller graphs. When $G$ is isomorphic to a Cartesian gra…