Pages that link to "Item:Q1584444"
From MaRDI portal
The following pages link to Factoring cardinal product graphs in polynomial time (Q1584444):
Displaying 27 items.
- Some properties on the tensor product of graphs obtained by monogenic semigroups (Q272447) (← links)
- On the Cartesian skeleton and the factorization of the strong product of digraphs (Q482282) (← links)
- A theory of decomposition into prime factors of layered interconnection networks (Q531607) (← links)
- Factoring a graph in polynomial time (Q579285) (← links)
- Recognizing triangulated Cartesian graph products (Q658038) (← links)
- On idomatic partitions of direct products of complete graphs (Q659730) (← 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)
- An almost complete description of perfect codes in direct products of cycles (Q864867) (← links)
- Fast factorization of Cartesian products of (directed) hypergraphs (Q906379) (← links)
- Characterizing \(r\)-perfect codes in direct products of two and three cycles (Q1041710) (← links)
- A polynomial time algorithm for finding the prime factors of Cartesian- product graphs (Q1067411) (← links)
- Cartesian graph factorization at logarithmic cost per edge (Q1210332) (← links)
- A prime factor theorem for bipartite graphs (Q1631624) (← links)
- On uniqueness of prime bipartite factors of graphs (Q1947011) (← links)
- Direct product primality testing of graphs is GI-hard (Q1998840) (← links)
- Exact-2-relation graphs (Q2197422) (← links)
- Some properties on the lexicographic product of graphs obtained by monogenic semigroups (Q2637547) (← links)
- Fast recognition of direct and strong products (Q2940100) (← 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)
- A METHOD FOR FINDING AGGREGATED REPRESENTATIONS OF LINEAR DYNAMICAL SYSTEMS (Q3565438) (← links)
- Distance formula for direct-co-direct product in the case of disconnected factors (Q5888905) (← links)
- A Heuristic for Direct Product Graph Decomposition (Q6075715) (← links)
- On some metric properties of direct-co-direct product (Q6096252) (← links)
- Robust Factorizations and Colorings of Tensor Graphs (Q6195952) (← links)
- On distance and strong metric dimension of the modular product (Q6661081) (← links)
