The world’s shortest international border is not only tiny in length but also steeped in unusual history and strange quirks ...

We propose a simple and tractable model based on iterative biased random walks where edge weights increase over time as function of the traversed path length. Under mild assumptions, we prove that ...

Abstract: An efficient and flexible algorithm is presented for finding a k shortest loopless path with distinct initial links from one node to each other node. Low-order polynomial bounds are ...