Pages that link to "Item:Q482282"
From MaRDI portal
The following pages link to On the Cartesian skeleton and the factorization of the strong product of digraphs (Q482282):
Displaying 11 items.
- A local prime factor decomposition algorithm (Q536219) (← links)
- Local algorithms for the prime factorization of strong product graphs (Q626891) (← links)
- Asymmetric colorings of products of graphs and digraphs (Q2026319) (← links)
- Reciprocal best match graphs (Q2299268) (← links)
- Best match graphs (Q2420450) (← links)
- Strong products of hypergraphs: unique prime factorization theorems and algorithms (Q2449107) (← links)
- Computing the directed Cartesian-product decomposition of a directed graph from its undirected decomposition in linear time (Q2515582) (← links)
- Fast recognition of direct and strong products (Q2940100) (← links)
- Digraphs Products (Q3120442) (← links)
- Boundary-type sets of strong product of directed graphs (Q3390054) (← links)
- On Cartesian skeletons of graphs (Q3552332) (← links)