Multiple-Source Shortest Paths in Embedded Graphs
Multiple-source single-sink maximum flow in directed planar graphs in $O(n^{1.5} \log n)$ time
Multiscale approach for the network compression-friendly ordering
Multistep greedy algorithm identifies community structure in real-world and computer-generated networks
Mutual Search