0x23

There also has been a lot research lately in the field. For example, [1,2] has a lot of new methods on concurrent or space efficient hash tables.

[1] http://algo2.iti.kit.edu/maier.php

[2] https://github.com/TooBiased/growt

I use jump commands:

export MARKPATH=$HOME/.marks function jump { cd -P $MARKPATH/$1 2>/dev/null || echo "No such mark: $1" } function ju { cd -P $MARKPATH/$1 2>/dev/null || echo "No such mark: $1" } function mark { mkdir -p $MARKPATH; ln -s $(pwd) $MARKPATH/$1 } function unmark { rm -i $MARKPATH/$1 } function marks { ls -l $MARKPATH | sed 's/ / /g' | cut -d' ' -f9- | sed 's/ -/\t-/g' && echo }

I think the original source is #http://jeroenjanssens.com/2013/08/16/quickly-navigate-your-f...

Another neat trick is to set you .inputrc to vi mode with

set editing-mode vi set keymap vi

and then put this in your .bashrc

bind -m vi-insert -x '"\C-h"':'"pushd . 1>/dev/null 2>/dev/null && cd ../ && echo -e ${LILA} $PWD && ls"' bind -m vi-insert -x '"\C-n"':'"popd 1>/dev/null 2>/dev/null && echo -e ${LILA} $PWD && ls"' bind -m vi-insert -x '"\C-b":"cd $HOME && echo -e ${LILA} $PWD && ls"'

This enables you to go a directory up using ctrl-h and go back using ctrl-n.

On that note, here is the currently fastest implementation for the problem https://arxiv.org/abs/1808.05458 and here on github https://github.com/viecut/viecut

We are proud to announce the release of a major update of our graph partitioning framework KaHiP (Karlsruhe High Quality Graph Partitioning). KaHiP is a family of high quality graph partitioning programs. It contains various graph partitioning algorithms that can be configured to either achieve the best known partitions for many standard benchmark instances or to be a good trade-off between partition quality and running time. Since the last major release we added:

- node ordering algorithms to compute fill-in reduced node orderings - ILP based exact solvers and partition improvement algorithms - global multisection process mapping algorithms - and a lot of minor improvements of our system

This is round of improvements and extensions is due to Alexandra Henzinger, Alexander Noe, Wolfgang Ost, Daniel Seemaier

The code is available under MIT Licence.

* open source implementation / website https://kahip.github.io

* github https://github.com/KaHIP

We are glad for any comments, stars and error reports (or even bug fixes) that you send us.

Alexandra Henzinger, Alexander Noe, Wolfgang Ost, Peter Sanders, Christian Schulz, Daniel Seemaier Karlsruhe Institute of Technology (KIT) University of Vienna