29 citations · 31 across the 4 of their papers we have counts for
Showing cs.DSShow all
3 papers · 1 filter
cs.DS2022
Asymptotic Experiments with Data Structures: Bipartite Graph Matchings and Covers
Eason Li, Franc Brglez
We consider instances of bipartite graphs and a number of asymptotic performance experiments in three projects: (1) top movie lists, given databases of movies and viewers, (2) maxi…
cs.DS2014★ 29 cited
Low-Autocorrelation Binary Sequences: On Improved Merit Factors and Runtime Predictions to Achieve Them
Borko Bošković, Franc Brglez, Janez Brest
The search for binary sequences with a high figure of merit, known as the low autocorrelation binary sequence (}) problem, represents a formidable computational challenge. To…
cs.DS2013★ 2 cited
On Self-Avoiding Walks across n-Dimensional Dice and Combinatorial Optimization: An Introduction
Franc Brglez
Self-avoiding walks (SAWs) were introduced in chemistry to model the real-life behavior of chain-like entities such as solvents and polymers, whose physical volume prohibits multip…