Jeremy W. Murphy

Musser-Nishanov generic sequence-matching algorithm(s)

29

## Introduction In 1997, [David R. Musser](http://www.cs.rpi.edu/~musser/) and [Gor V. Nishanov](https://www.linkedin.com/in/gor-nishanov-71aa2113) wrote a hitherto unpublished paper and accompanying code, _[A Fast Generic Sequence Matching Algorithm](http://www.cs.rpi.edu/~musser/gp/gensearch1.pdf)_. It struck me as odd...

Stack-overflow in boost::read_graphviz_detail::parser::parse_subgraph

19

https://bugs.chromium.org/p/oss-fuzz/issues/detail?id=66719 ``` +----------------------------------------Release Build Stacktrace----------------------------------------+ Command: /mnt/scratch0/clusterfuzz/resources/platform/linux/unshare -c -n /mnt/scratch0/clusterfuzz/bot/builds/clusterfuzz-builds_boost_fa513528a55ae19c064fe12b99e08e0dbc98b83f/revisions/boost_graph_graphviz_fuzzer -rss_limit_mb=2560 -timeout=60 -runs=100 /mnt/scratch0/clusterfuzz/bot/inputs/fuzzer-testcases/crash-ec3a74d351f80590a35c0c6bace0c3a2fd548235 Time ran: 0.5343647003173828 INFO: Running with entropic power schedule (0xFF, 100). INFO: Seed: 49547342 INFO: Loaded...

New near-linear time algorithm to solve the minimum cut problem for undirected graphs

8

Google Research blog post: https://research.google/blog/solving-the-minimum-cut-problem-for-undirected-graphs/ The actual paper: https://epubs.siam.org/doi/10.1137/1.9781611977912.111 This would presumably be a considerable improvement over our existing Stoer Wagner algorithm.

From [Keith Bennet](https://github.com/boostorg/graph/wiki/Feedback-submissions-from-the-Boost-User-mailing-list#keith-bennett): > astar_search() takes too much time to initialize all vertices (in a 2048x2048x40 matrix) even though we only need to initialize vertices when they are added to...

k-ary tree data structure

8

This is a long way from finished but it might be useful to start a discussion about it early. First thing: this is not a true pull request. This is...

When @daankolthof added more tests to MAS, it occurred to me that different but equally correct implementations of the algorithm might return different orderings when tie-breaking edges with equal weights....

Polynomial: fixes for Stein gcd

3

**Still slightly a work in progress...** Primarily, this PR is to fill in the missing gaps for making Stein gcd actually support polynomials. However, in working on it, I realized...