Strong products of hypergraphs: unique prime factorization theorems and algorithms (Q2449107): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / arXiv ID
 
Property / arXiv ID: 1305.1824 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3993087 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Factorization of products of hypergraphs: Structure and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5590666 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding the prime factors of strong direct product graphs in polynomial time / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Cartesian skeletons of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3005852 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A local prime factor decomposition algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of recognizing \(S\)-composite and \(S\)-prime graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey on hypergraph products / rank
 
Normal rank
Property / cites work
 
Property / cites work: Diagonalized Cartesian products of \(S\)-prime graphs are \(S\)-prime / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5534233 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4523707 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cardinal multiplication of structures with a reflexive relation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3970348 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4344108 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2777507 / rank
 
Normal rank

Latest revision as of 12:25, 8 July 2024

scientific article
Language Label Description Also known as
English
Strong products of hypergraphs: unique prime factorization theorems and algorithms
scientific article

    Statements

    Strong products of hypergraphs: unique prime factorization theorems and algorithms (English)
    0 references
    0 references
    0 references
    0 references
    6 May 2014
    0 references
    0 references
    0 references
    0 references
    0 references
    hypergraph
    0 references
    strong product
    0 references
    normal product
    0 references
    prime factor decomposition algorithms
    0 references
    Cartesian skeleton
    0 references
    0 references
    0 references