Fast factorization of Cartesian products of (directed) hypergraphs
From MaRDI portal
Publication:906379
DOI10.1016/j.tcs.2015.11.038zbMath1334.05167arXiv1508.07181OpenAlexW2189182086MaRDI QIDQ906379
Publication date: 21 January 2016
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1508.07181
Analysis of algorithms (68W40) Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Graph operations (line graphs, products, etc.) (05C76)
Related Items (2)
Associativity and non-associativity of some hypergraph products ⋮ The cut method on hypergraphs for the Wiener index
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Factoring a graph in polynomial time
- Diagonalized Cartesian products of \(S\)-prime graphs are \(S\)-prime
- Graph multiplication
- Recognizing Cartesian products in linear time
- 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
- Cartesian graph factorization at logarithmic cost per edge
- On subgraphs of Cartesian product graphs
- On subgraphs of Cartesian product graphs and S-primeness
- Factorization of products of hypergraphs: Structure and algorithms
- Hypergraph theory. An introduction
- A survey on hypergraph products
- On the complexity of recognizing \(S\)-composite and \(S\)-prime graphs
- Strong products of hypergraphs: unique prime factorization theorems and algorithms
- Über das schwache Kartesische Produkt von Graphen
- The Cartesian product of hypergraphs
- Monotone Properties of k-Uniform Hypergraphs are Weakly Evasive
- Remarks on the Cartesian product of two graphs
- Product graph representations
- A Linear-Time Algorithm for Computing the Prime Decomposition of a Directed Graph with Regard to the Cartesian Product
This page was built for publication: Fast factorization of Cartesian products of (directed) hypergraphs
