Recognizing Cartesian products in linear time (Q864136): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q56688309, #quickstatements; #temporary_batch_1711234560214
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q4773298 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cartesian graph factorization at logarithmic cost per edge / rank
 
Normal rank
Property / cites work
 
Property / cites work: Product graph representations / 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: Q4294601 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4523707 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph multiplication / rank
 
Normal rank
Property / cites work
 
Property / cites work: SOME UNSOLVED PROBLEMS IN GRAPH THEORY / rank
 
Normal rank
Property / cites work
 
Property / cites work: Factoring a graph in polynomial time / rank
 
Normal rank

Revision as of 13:07, 25 June 2024

scientific article
Language Label Description Also known as
English
Recognizing Cartesian products in linear time
scientific article

    Statements

    Recognizing Cartesian products in linear time (English)
    0 references
    0 references
    0 references
    13 February 2007
    0 references
    Cartesian product graphs
    0 references
    linear algorithm
    0 references
    decomposition
    0 references

    Identifiers