Pages that link to "Item:Q579285"
From MaRDI portal
The following pages link to Factoring a graph in polynomial time (Q579285):
Displaying 35 items.
- Recognizing some complementary products (Q389934) (← links)
- Computing equivalence classes among the edges of a graph with applications (Q686277) (← links)
- Finding the prime factors of strong direct product graphs in polynomial time (Q686286) (← links)
- A note on Winkler's algorithm for factoring a connected graph (Q686292) (← links)
- Recognizing Cartesian products in linear time (Q864136) (← links)
- Fast factorization of Cartesian products of (directed) hypergraphs (Q906379) (← links)
- Unique prime Cartesian factorization of graphs over finite fields (Q1047495) (← links)
- A polynomial time algorithm for finding the prime factors of Cartesian- product graphs (Q1067411) (← links)
- Strict refinement for graphs and digraphs (Q1072575) (← links)
- Directed Cartesian-product graphs have unique factorizations that can be computed in polynomial time (Q1098860) (← links)
- Cartesian graph factorization at logarithmic cost per edge (Q1210332) (← links)
- Strong products of Kneser graphs (Q1336712) (← links)
- Recognizing Cartesian graph bundles (Q1356477) (← links)
- Factoring cardinal product graphs in polynomial time (Q1584444) (← links)
- Algorithm for recognizing Cartesian graph bundles (Q1613382) (← links)
- Strong products of \(\chi\)-critical graphs (Q1801332) (← links)
- On the complexity of the embedding problem for hypercube related graphs (Q1801670) (← links)
- Factorization of products of hypergraphs: Structure and algorithms (Q1939276) (← links)
- On the complexity of recognizing \(S\)-composite and \(S\)-prime graphs (Q1949105) (← links)
- Direct product primality testing of graphs is GI-hard (Q1998840) (← links)
- Factoring Boolean functions using graph partitioning (Q2387436) (← links)
- Computing the directed Cartesian-product decomposition of a directed graph from its undirected decomposition in linear time (Q2515582) (← links)
- On recognition of strong graph bundles (Q2777507) (← links)
- The Cartesian product of graphs with loops (Q2835387) (← links)
- On some graph operations and related applications (Q2839255) (← links)
- Factoring directed graphs with respect to the cardinal product in polynomial time II (Q2997605) (← links)
- Factoring directed graphs with respect to the cardinal product in polynomial time (Q3504810) (← links)
- On Cartesian skeletons of graphs (Q3552332) (← links)
- Product graph representations (Q4020705) (← links)
- Factoring cartesian‐product graphs (Q4309984) (← links)
- On Cartesian products of signed graphs (Q5896107) (← links)
- Factorization and pseudofactorization of weighted graphs (Q6162029) (← links)
- Robust Factorizations and Colorings of Tensor Graphs (Q6195952) (← links)
- Recognizing graph products and bundles (Q6560201) (← links)
- The complement of the Djoković-Winkler relation (Q6658058) (← links)
