Approximate graph products (Q1024311): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q56990862, #quickstatements; #temporary_batch_1712446058616
ReferenceBot (talk | contribs)
Changed an Item
 
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: A polynomial time algorithm for finding the prime factors of Cartesian- product 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: Q4523707 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognizing Cartesian products in linear time / 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: Graph multiplication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4936660 / 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

Latest revision as of 15:44, 1 July 2024