Finding the prime factors of strong direct product graphs in polynomial time
From MaRDI portal
(Redirected from Publication:686286)
Recommendations
- Fast recognition of direct and strong products
- Factoring cardinal product graphs in polynomial time
- A polynomial time algorithm for finding the prime factors of Cartesian- product graphs
- Factoring a graph in polynomial time
- Factoring directed graphs with respect to the cardinal product in polynomial time II
Cites work
- scientific article; zbMATH DE number 3723879 (Why is no real title available?)
- scientific article; zbMATH DE number 568809 (Why is no real title available?)
- scientific article; zbMATH DE number 3309924 (Why is no real title available?)
- A note on Winkler's algorithm for factoring a connected graph
- A polynomial time algorithm for finding the prime factors of Cartesian- product graphs
- Cardinal multiplication of structures with a reflexive relation
- Cartesian graph factorization at logarithmic cost per edge
- Computing equivalence classes among the edges of a graph with applications
- Das lexikographische Produkt gerichteter Graphen. (The lexicographic product of directed graphs)
- Directed Cartesian-product graphs have unique factorizations that can be computed in polynomial time
- Factoring a graph in polynomial time
- Graph multiplication
- On the cancellation law among finite relational structures
- Operations with structures
- Prefibers and the cartesian product of metric spaces
- Product graph representations
- Recognizing Composite Graphs is Equivalent to Testing Graph Isomorphism
- Retracts of hypercubes
- Strict refinement for graphs and digraphs
- The Categorical Product of Graphs
- The Kronecker Product of Graphs
Cited in
(35)- On recognition of strong graph bundles
- Chromatic numbers of the strong product of odd cycles
- Strong products of hypergraphs: unique prime factorization theorems and algorithms
- Factoring a graph in polynomial time
- Strong products of Kneser graphs
- A local prime factor decomposition algorithm
- Factoring directed graphs with respect to the cardinal product in polynomial time II
- Asymmetric colorings of products of graphs and digraphs
- Weak reconstruction of strong product graphs
- On the chromatic number of the lexicographic product and the Cartesian sum of graphs
- Approximate graph products
- Computing equivalence classes among the edges of a graph with applications
- Factoring cardinal product graphs in polynomial time
- A polynomial time algorithm for finding the prime factors of Cartesian- product graphs
- Robust Factorizations and Colorings of Tensor Graphs
- The subset-strong product of graphs
- Recognizing triangulated Cartesian graph products
- A prime factor theorem for a generalized direct product
- Coloring graph products---a survey
- Local algorithms for the prime factorization of strong product graphs
- Graphs S(n, k) and a Variant of the Tower of Hanoi Problem
- On some metric properties of direct-co-direct product
- On the Cartesian skeleton and the factorization of the strong product of digraphs
- scientific article; zbMATH DE number 2230259 (Why is no real title available?)
- scientific article; zbMATH DE number 2230321 (Why is no real title available?)
- Factoring directed graphs with respect to the cardinal product in polynomial time
- Strong products of \(\chi\)-critical graphs
- A theory of decomposition into prime factors of layered interconnection networks
- A Heuristic for Direct Product Graph Decomposition
- Edge-transitive products
- NZ-flows in strong products of graphs
- Recognizing graph products and bundles
- On distance and strong metric dimension of the modular product
- Fast recognition of direct and strong products
- Direct product primality testing of graphs is GI-hard
This page was built for publication: Finding the prime factors of strong direct product graphs in polynomial time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q686286)
