Factoring cardinal product graphs in polynomial time
From MaRDI portal
Publication:1584444
DOI10.1016/S0012-365X(98)00069-7zbMATH Open0955.68089MaRDI QIDQ1584444FDOQ1584444
Publication date: 2 November 2000
Published in: Discrete Mathematics (Search for Journal in Brave)
Recommendations
- Factoring a graph in polynomial time
- A polynomial time algorithm for finding the prime factors of Cartesian- product graphs
- Factoring directed graphs with respect to the cardinal product in polynomial time II
- Finding the prime factors of strong direct product graphs in polynomial time
- Factoring directed graphs with respect to the cardinal product in polynomial time
Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)
Cites Work
- Metric Spaces and Positive Definite Functions
- Graph multiplication
- The Kronecker Product of Graphs
- Associative products of graphs
- On Isometric Embeddings of Graphs
- The Categorical Product of Graphs
- Cartesian graph factorization at logarithmic cost per edge
- On the complexity of recognizing Hamming graphs and related classes of graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- The Automorphism Group of a Product of Graphs
- Finding the prime factors of strong direct product graphs in polynomial time
- Über das schwache Kartesische Produkt von Graphen
- A polynomial time algorithm for finding the prime factors of Cartesian- product graphs
- Product graph representations
- Factoring a graph in polynomial time
- Isomorphic components of Kronecker product of bipartite graphs
- Title not available (Why is that?)
- Cardinal multiplication of structures with a reflexive relation
- On the weak reconstruction of Cartesian-product graphs
- On a Problem of G. Birkhoff
- Title not available (Why is that?)
- Minimum dimension embedding of finite metric spaces
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (24)
- Factoring a graph in polynomial time
- A note on Winkler's algorithm for factoring a connected graph
- Direct product primality testing of graphs is GI-hard
- Some properties on the tensor product of graphs obtained by monogenic semigroups
- A polynomial time algorithm for finding the prime factors of Cartesian- product graphs
- Factoring directed graphs with respect to the cardinal product in polynomial time II
- A prime factor theorem for bipartite graphs
- Factoring directed graphs with respect to the cardinal product in polynomial time
- Characterizing \(r\)-perfect codes in direct products of two and three cycles
- Distance formula for direct-co-direct product in the case of disconnected factors
- Finding the prime factors of strong direct product graphs in polynomial time
- Cartesian graph factorization at logarithmic cost per edge
- An almost complete description of perfect codes in direct products of cycles
- Robust Factorizations and Colorings of Tensor Graphs
- Exact-2-relation graphs
- Some properties on the lexicographic product of graphs obtained by monogenic semigroups
- On the Cartesian skeleton and the factorization of the strong product of digraphs
- On some metric properties of direct-co-direct product
- A METHOD FOR FINDING AGGREGATED REPRESENTATIONS OF LINEAR DYNAMICAL SYSTEMS
- Fast factorization of Cartesian products of (directed) hypergraphs
- On distance and strong metric dimension of the modular product
- Recognizing triangulated Cartesian graph products
- On idomatic partitions of direct products of complete graphs
- A Heuristic for Direct Product Graph Decomposition
This page was built for publication: Factoring cardinal product graphs in polynomial time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1584444)
