A local prime factor decomposition algorithm (Q536219): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2017823965 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1705.03817 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On subgraphs of Cartesian product graphs and S-primeness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5590666 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Factorable Extensions and Subgraphs of Prime Graphs / 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: Q3088443 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On direct product cancellation of graphs / 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: Diagonalized Cartesian products of \(S\)-prime graphs are \(S\)-prime / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate graph products / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local algorithms for the prime factorization of strong product graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4523707 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5302113 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognizing Cartesian graph bundles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Factoring cartesian‐product graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the weak reconstruction of Cartesian-product graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weak k-reconstruction of cartesian product graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient method for decomposition of regular structures using graph products / rank
 
Normal rank
Property / cites work
 
Property / cites work: On subgraphs of Cartesian product graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new concept of primeness in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3838189 / 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: A note on quasi-robust cycle bases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph multiplication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4065584 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fixed box theorem for the cartesian product of graphs and metric spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4936660 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2777507 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quasi-independence, homology and the unity of type: a topological theory of characters / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithm for recognizing Cartesian graph bundles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weak reconstruction of strong product graphs / rank
 
Normal rank

Latest revision as of 02:01, 4 July 2024

scientific article
Language Label Description Also known as
English
A local prime factor decomposition algorithm
scientific article

    Statements

    A local prime factor decomposition algorithm (English)
    0 references
    0 references
    16 May 2011
    0 references
    0 references
    strong product graph
    0 references
    prime factor decomposition
    0 references
    local covering
    0 references
    backbone
    0 references
    color-continuation
    0 references
    S1-condition
    0 references
    \(S\)-prime
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references