Finding the prime factors of strong direct product graphs in polynomial time

From Tetherless World Wiki

Jump to: navigation, search

\begin{bibtex} @article{DBLP:journals/dm/FeigenbaumS92, 

 author    = {Joan Feigenbaum and
              Alejandro A. Sch{\"a}ffer},
 title     = {Finding the prime factors of strong direct product graphs
              in polynomial time},
 journal   = {Discrete Mathematics},
 volume    = {109},
 number    = {1-3},
 year      = {1992},
 pages     = {77-102},
 ee        = {http://dx.doi.org/10.1016/0012-365X(92)90280-S},
 bibsource = {DBLP, http://dblp.uni-trier.de}

}

\end{bibtex}

Retrieved from "http://tw.rpi.edu/wiki/Finding_the_prime_factors_of_strong_direct_product_graphs_in_polynomial_time"
Personal tools