36 citations · 59 across the 4 of their papers we have counts for
4 papers
IGraph/M: graph theory and network analysis for Mathematica
Szabolcs Horvát, Jakub Podkalicki, Gábor Csárdi +4
IGraph/M is an efficient general purpose graph theory and network analysis package for Mathematica. IGraph/M serves as the Wolfram Language interfaces to the igraph C library, and…
Connectedness matters: Construction and exact random sampling of connected graphs
Szabolcs Horvát, Carl D. Modes
We describe a new method for the random sampling of connected networks with a specified degree sequence. We consider both the case of simple graphs and that of loopless multigraphs…
Tight Localizations of Feedback Sets
Michael Hecht, Krzysztof Gonciarz, Szabolcs Horvát
The classical NP-hard feedback arc set problem (FASP) and feedback vertex set problem (FVSP) ask for a minimum set of arcs or vertices whos…
Complex phase space of a simple synchronization model
Szabolcs Horvát, Zoltán Néda
The phase-space of a simple synchronization model is thoroughly investigated. The model considers two-mode stochastic oscillators, coupled through a pulse-like interaction controll…