论文信息 - Factoring a Graph in Polynomial Time

Factoring a Graph in Polynomial Time

We present a polynomial-time algorithm for deciding whether a given connected graph is a non-trivial Cartesian product. The method entails first representing the graph as an isometric subgraph of a Cartesian product of graphs, then finding a suitable partition of the factors.

Peter Winkler | P. Winkler

[1] R. Graham,et al. On isometric embeddings of graphs , 1985 .

[2] Joan Feigenbaum,et al. A polynomial time algorithm for finding the prime factors of cartesian-product graphs , 1985, Discret. Appl. Math..