Skip to main content
Share Your Experience: Take the 2024 Developer Survey
22 votes

Algorithm for finding a 3-cycle cover

The cycle cover problem (CC) is the problem of finding a spanning set of cycles in a given directed or undirected input graph. If all the cycles in the cover must consist of at least $k$ edges/arcs, ...
Gamow's user avatar
  • 5,772
7 votes
Accepted

Implementation of Wilf-Zeilberger and related methods

It is implemented in Maxima (http://maxima.sourceforge.net/docs/manual/de/maxima_77.html#SEC400), to which Sage has interface. A few dozens of examples (ranging from very easy to very difficult) I ...
Vladimir Dotsenko's user avatar
6 votes
Accepted

Most efficient inplace merge algorithms (stable and unstable)

TLDR The latest stable one with linear moves is from 2008 and with detailed description can be found here. According to their benchmarks, it is less than two times slower than standard merge that ...
Guest's user avatar
  • 76
5 votes
Accepted

Are there any implementations of a graph crossing algorithm?

A slow brute-force implementation of the graph crossing number was added to Sage in Sage Trac ticket 24216: Add crossing number of a graph Github issue: Add crossing number of a graph #24216 which ...
Samuel Lelièvre's user avatar
2 votes

Implementation of surreal numbers for games

Here is an implementation of Surreal Numbers in a relatively new language, Julia. https://github.com/mroughan/SurrealNumbers.jl Described at https://www.sciencedirect.com/science/article/pii/...
Matt's user avatar
  • 21
2 votes
Accepted

Operations on Sentential Decision Diagrams

I try to address your questions one after the other. I agree that the description of the algorithm is really succinct. To understand it better, I would encourage you to parallel this algorithm with ...
holf's user avatar
  • 2,174
1 vote

Word length using entropy : Maximum entropy criteria

Disclaimer: This is based on generic information theory knowledge only. Too long for a comment. Summary: The pointwise product of your two plots should go to some limit, as the relevant blocklengths ...
kodlu's user avatar
  • 2,070
1 vote

Powerful Algorithms too complex to implement

Perfect hash construction (https://en.wikipedia.org/wiki/Perfect_hash_function#Construction) would apply to any use-case with static or infrequently-changing keys (e.g. top level domain names on ...

Only top scored, non community-wiki answers of a minimum length are eligible