New kth-shortest path algorithm

H. Maruyama

IEICE Transactions on Information and Systems

Paper

01 Mar 1993

New kth-shortest path algorithm

Abstract

This paper presents a new algorithm for finding the kth- shortest paths between a specified pair of vertices in a directed graph with arcs having non-negative costs.

Paper

Sparse Dynamic Programming I: Linear Cost Functions

David Eppstein, Zvi Galil, et al.

Journal of the ACM

Conference paper

Realistic Synthetic Financial Transactions for Anti-Money Laundering Models

Erik Altman, Jovan Blanusa, et al.

NeurIPS 2023

Conference paper

From modern standard Arabic to Levantine ASR: Leveraging GALE for dialects

Hagen Soltau, Lidia Mangu, et al.

ASRU 2011

Conference paper

Risks and potentials of using EMV for internet payments

Els van Herreweghen, Uta Wille

USENIX Workshop on Smartcard Technology 1999

View all publications

Abstract

Related

Sparse Dynamic Programming I: Linear Cost Functions

Realistic Synthetic Financial Transactions for Anti-Money Laundering Models

From modern standard Arabic to Levantine ASR: Leveraging GALE for dialects

Risks and potentials of using EMV for internet payments