A polynomial time algorithm for finding the prime factors of cartesian-product graphs
1985 ◽
Vol 12
(2)
◽
pp. 123-138
◽
Directed cartesian-product graphs have unique factorizations that can be computed in polynomial time
1986 ◽
Vol 15
(1)
◽
pp. 105-110
◽
Keyword(s):
Keyword(s):
2004 ◽
Vol 8
(2)
◽
pp. 171-181
◽
Keyword(s):
2014 ◽
Vol 61
(1)
◽
pp. 51-78
◽