About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Publication
Journal of Graph Theory
Paper
Product graph representations
Abstract
We study a hierarchy of canonical representations of grpahs as subgraphs of cartesian products of graphs. This hierarchy starts with the isometric representation, includes the 2‐isometric represnetation, and ends with the cartesian prime factorization. We show that all three representations can be obtained in O(nm) time using O(m) space, for graphs with n vertices and m edges. The algorithms have immediate parallel versions that use n3 processors and run in O(log2 n) time. © 1929 John Wiley & Sons, Inc. Copyright © 1992 Wiley Periodicals, Inc., A Wiley Company