Partial star products: a local covering approach for the recognition of approximate Cartesian product graphs (Q2254071): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Cartesian graph factorization at logarithmic cost per edge / rank
 
Normal rank
Property / cites work
 
Property / cites work: Arboricity and Subgraph Listing Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Directed Cartesian-product graphs have unique factorizations that can be computed in polynomial time / 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: A polynomial time algorithm for finding the prime factors of Cartesian- product graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Isometric Embeddings of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3088443 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A local prime factor decomposition algorithm / 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: Unique square property, equitable partitions, and product-like graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognizing Cartesian products in linear time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognizing Cartesian graph bundles / 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: Factoring 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: Graph multiplication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2777507 / 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 15:22, 9 July 2024

scientific article
Language Label Description Also known as
English
Partial star products: a local covering approach for the recognition of approximate Cartesian product graphs
scientific article

    Statements

    Partial star products: a local covering approach for the recognition of approximate Cartesian product graphs (English)
    0 references
    0 references
    0 references
    0 references
    4 February 2015
    0 references
    Cartesian product
    0 references
    approximate product
    0 references
    partial star product
    0 references
    product relation
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references