We theoretically implement a strategy from quantum computation to simulate Stuart-Landau oscillator dynamics in all-to-all connected networks, also referred as complete graphs. The technique builds upon the triad structure minor embedding which expands dense graphs of interconnected elements into sparse ones which can potentially be realised in future on-chip solid state technologies with tunable edge weights. Our analysis reveals that the minor embedding procedure allows simulating the XY model on complete graphs, thus bypassing a severe geometric constraint.