Cartesian graph factorization at logarithmic cost per edge (Q1210332): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q56688307
@@ Property / Wikidata QID: Q56688307 / rank @@
+Normal rank
@@ Property / cites work @@
+Computing equivalence classes among the edges of a graph with applications
+Normal rank
@@ Property / cites work @@
+Product graph representations
@@ Property / cites work: Product graph representations / rank @@
+Normal rank
@@ Property / cites work @@
+Directed Cartesian-product graphs have unique factorizations that can be computed in polynomial time
+Normal rank
@@ Property / cites work @@
+A polynomial time algorithm for finding the prime factors of Cartesian- product graphs
+Normal rank
@@ Property / cites work @@
+Q3684121
@@ Property / cites work: Q3684121 / rank @@
+Normal rank
@@ Property / cites work @@
+On Isometric Embeddings of Graphs
@@ Property / cites work: On Isometric Embeddings of Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A note on Winkler's algorithm for factoring a connected graph
+Normal rank
@@ Property / cites work @@
+Graph multiplication
@@ Property / cites work: Graph multiplication / rank @@
+Normal rank
@@ Property / cites work @@
+Factoring a graph in polynomial time
@@ Property / cites work: Factoring a graph in polynomial time / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/bf01200428
+Normal rank
@@ Property / OpenAlex ID @@
+W1992112020
@@ Property / OpenAlex ID: W1992112020 / rank @@
+Normal rank