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.

Talk

ChemChat | Conversational Expert Assistant in Material Science and Data Visualization

Tim Erdmann, Stefan Zecevic, et al.

ACS Spring 2024

Paper

Perceptual Organization for Scene Segmentation and Description

Rakesh Mohan, Ramakant Nevatia

IEEE Transactions on Pattern Analysis and Machine Intelligence

Conference paper

Are GNNs the Right Tool to Mine the Blockchain? The Case of the Bitcoin Generator Scam

Zhikun Yuen, Paula Branco, et al.

DSAA 2023

Paper

Horn Clauses and Database Dependencies

Ronald Fagin

Journal of the ACM

View all publications

Abstract

Related

ChemChat | Conversational Expert Assistant in Material Science and Data Visualization

Perceptual Organization for Scene Segmentation and Description

Are GNNs the Right Tool to Mine the Blockchain? The Case of the Bitcoin Generator Scam

Horn Clauses and Database Dependencies