A polynomial time algorithm for finding the prime factors of Cartesian- product graphs (Q1067411): Difference between revisions

@@ Property / describes a project that uses @@
+Algorithm 97
@@ Property / describes a project that uses: Algorithm 97 / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Q4773298
@@ Property / cites work: Q4773298 / rank @@
+Normal rank
@@ Property / cites work @@
+Recognizing Composite Graphs is Equivalent to Testing Graph Isomorphism
+Normal rank
@@ Property / cites work @@
+On Isometric Embeddings of Graphs
@@ Property / cites work: On Isometric Embeddings of Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Graph multiplication
@@ Property / cites work: Graph multiplication / rank @@
+Normal rank
@@ Property / cites work @@
+Stability of cartesian products
@@ Property / cites work: Stability of cartesian products / rank @@
+Normal rank
@@ Property / cites work @@
+Efficiency of a Good But Not Linear Set Union Algorithm
+Normal rank
@@ Property / DBLP publication ID @@
+journals/dam/FeigenbaumHS85
@@ Property / DBLP publication ID: journals/dam/FeigenbaumHS85 / rank @@
+Normal rank