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

Heuristic search viewed as path finding in a graph

Ira Pohl

Artificial Intelligence

Conference paper

LaMAGIC2: Advanced Circuit Formulations for Language Model-Based Analog Topology Generation

Chen-chia Chang, Wan-hsuan Lin, et al.

ICML 2025

Workshop paper

Bridging the Gap: Unifying HCI & ML Perspectives on Mutual Theory of Mind

Zahra Ashktorab, Djallel Bouneffouf, et al.

IJCAI 2025

Paper

Designing irregular parallel algorithms with mutual exclusion and lock-free protocols

Guojing Cong, David A. Bader

Journal of Parallel and Distributed Computing

View all publications

Abstract

Related

Heuristic search viewed as path finding in a graph

LaMAGIC2: Advanced Circuit Formulations for Language Model-Based Analog Topology Generation

Bridging the Gap: Unifying HCI & ML Perspectives on Mutual Theory of Mind

Designing irregular parallel algorithms with mutual exclusion and lock-free protocols