On the Cartesian skeleton and the factorization of the strong product of digraphs
From MaRDI portal
Publication:482282
DOI10.1016/j.tcs.2014.10.045zbMath1315.05135arXiv1401.4965OpenAlexW1978416015MaRDI QIDQ482282
Publication date: 22 December 2014
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1401.4965
Graph algorithms (graph-theoretic aspects) (05C85) Directed graphs (digraphs), tournaments (05C20) Graph operations (line graphs, products, etc.) (05C76)
Related Items (5)
Best match graphs ⋮ Asymmetric colorings of products of graphs and digraphs ⋮ Reciprocal best match graphs ⋮ Boundary-type sets of strong product of directed graphs ⋮ Digraphs Products
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A local prime factor decomposition algorithm
- Local algorithms for the prime factorization of strong product graphs
- Finding the prime factors of strong direct product graphs in polynomial time
- Graph multiplication
- Recognizing Cartesian products in linear time
- Weak reconstruction of strong product graphs
- Approximate graph products
- A polynomial time algorithm for finding the prime factors of Cartesian- product graphs
- Directed Cartesian-product graphs have unique factorizations that can be computed in polynomial time
- Factoring cardinal product graphs in polynomial time
- A survey on hypergraph products
- Quasi-independence, homology and the unity of type: a topological theory of characters
- Partial star products: a local covering approach for the recognition of approximate Cartesian product graphs
- Strong products of hypergraphs: unique prime factorization theorems and algorithms
- Fast recognition of direct and strong products
- Factoring directed graphs with respect to the cardinal product in polynomial time II
- Factoring directed graphs with respect to the cardinal product in polynomial time
- On Cartesian skeletons of graphs
- Optimal Analysis of Structures by Concepts of Symmetry and Regularity
- Cardinal multiplication of structures with a reflexive relation
- An efficient method for decomposition of regular structures using graph products
This page was built for publication: On the Cartesian skeleton and the factorization of the strong product of digraphs
