Recognizing Cartesian products in linear time
From MaRDI portal
Publication:864136
Recommendations
- Generalized line graphs: Cartesian products and complexity of recognition
- Recognizing Cartesian products of matrices and polytopes
- Fast searching on Cartesian products of graphs
- Fast recognition of partial star products and quasi Cartesian products
- Recognizing triangulated Cartesian graph products
- The fast search number of a Cartesian product of graphs
- A polynomial time algorithm for finding the prime factors of Cartesian- product graphs
- Computing the directed Cartesian-product decomposition of a directed graph from its undirected decomposition in linear time
- Fast recognition of direct and strong products
- scientific article; zbMATH DE number 125862
Cites work
- scientific article; zbMATH DE number 568809 (Why is no real title available?)
- scientific article; zbMATH DE number 1550912 (Why is no real title available?)
- scientific article; zbMATH DE number 3449757 (Why is no real title available?)
- A polynomial time algorithm for finding the prime factors of Cartesian- product graphs
- Cartesian graph factorization at logarithmic cost per edge
- Factoring a graph in polynomial time
- Graph multiplication
- Product graph representations
- SOME UNSOLVED PROBLEMS IN GRAPH THEORY
Cited in
(35)- DP‐coloring Cartesian products of graphs
- Partial star products: a local covering approach for the recognition of approximate Cartesian product graphs
- Epistatic arithmetic crossover based on Cartesian graph product in ensemble differential evolution
- Fast factorization of Cartesian products of (directed) hypergraphs
- On the complexity of recognizing \(S\)-composite and \(S\)-prime graphs
- A linear-time algorithm for computing the prime decomposition of a directed graph with regard to the Cartesian product
- Factoring a graph in polynomial time
- Product graph representations
- On the Colin de Verdière numbers of Cartesian graph products
- Bandwidth and pathwidth of three-dimensional grids
- ON THE EDGE-CONNECTIVITY OF CARTESIAN PRODUCT GRAPHS
- The arc-types of Cayley graphs
- Approximate graph products
- A note on Winkler's algorithm for factoring a connected graph
- Computing the directed Cartesian-product decomposition of a directed graph from its undirected decomposition in linear time
- A polynomial time algorithm for finding the prime factors of Cartesian- product graphs
- Cartesian graph factorization at logarithmic cost per edge
- Tree 3-spanners on generalized prisms of graphs
- Robust Factorizations and Colorings of Tensor Graphs
- Average running time analysis of an algorithm to calculate the size of the union of Cartesian products.
- Cartesian products of directed graphs with loops
- Recognizing triangulated Cartesian graph products
- Distance formula for direct-co-direct product in the case of disconnected factors
- Systematic and deterministic graph minor embedding for Cartesian products of graphs
- Treetopes and their graphs
- On some metric properties of direct-co-direct product
- On the Cartesian skeleton and the factorization of the strong product of digraphs
- Connectivity for some families of composition networks
- Recognizing some complementary products
- A survey on hypergraph products
- Factorization and pseudofactorization of weighted graphs
- The pre-hull number and lexicographic product
- On distance and strong metric dimension of the modular product
- Fast recognition of direct and strong products
- Fast recognition of partial star products and quasi Cartesian products
This page was built for publication: Recognizing Cartesian products in linear time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q864136)
