Factoring a graph in polynomial time
From MaRDI portal
Recommendations
- A polynomial time algorithm for finding the prime factors of Cartesian- product graphs
- Factoring cardinal product graphs in polynomial time
- Recognizing Cartesian products in linear time
- Finding the prime factors of strong direct product graphs in polynomial time
- Cartesian graph factorization at logarithmic cost per edge
Cites work
Cited in
(34)- Algorithm for recognizing Cartesian graph bundles
- Directed Cartesian-product graphs have unique factorizations that can be computed in polynomial time
- Factorization of products of hypergraphs: Structure and algorithms
- On recognition of strong graph bundles
- Recognizing Cartesian products in linear time
- Fast factorization of Cartesian products of (directed) hypergraphs
- Factoring Boolean functions using graph partitioning
- On the complexity of recognizing \(S\)-composite and \(S\)-prime graphs
- Strict refinement for graphs and digraphs
- On the complexity of the embedding problem for hypercube related graphs
- The Cartesian product of graphs with loops
- The complement of the Djoković-Winkler relation
- Strong products of Kneser graphs
- Unique prime Cartesian factorization of graphs over finite fields
- Product graph representations
- Factoring directed graphs with respect to the cardinal product in polynomial time II
- A note on Winkler's algorithm for factoring a connected graph
- Computing equivalence classes among the edges of a graph with applications
- Factoring cardinal product graphs in polynomial time
- Computing the directed Cartesian-product decomposition of a directed graph from its undirected decomposition in linear time
- Factoring cartesian‐product graphs
- A polynomial time algorithm for finding the prime factors of Cartesian- product graphs
- On Cartesian skeletons of graphs
- Cartesian graph factorization at logarithmic cost per edge
- Robust Factorizations and Colorings of Tensor Graphs
- Recognizing Cartesian graph bundles
- Finding the prime factors of strong direct product graphs in polynomial time
- Factoring directed graphs with respect to the cardinal product in polynomial time
- Recognizing some complementary products
- On some graph operations and related applications
- Strong products of \(\chi\)-critical graphs
- Recognizing graph products and bundles
- Factorization and pseudofactorization of weighted graphs
- Direct product primality testing of graphs is GI-hard
This page was built for publication: Factoring a graph in polynomial time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q579285)
