Efficiently Listing Bounded Length st-Paths
type: Item
instance of: scholarly article
title: Efficiently Listing Bounded Length st-Paths
zbMATH Open document ID: 1401.68256
DOI: 10.1007/978-3-319-19315-1_28
author: Romeo Rizzi
author: Gustavo Sacomoto
author: Marie-France Sagot
published in: Lecture Notes in Computer Science
publication date: 2015-09-15T00:00:00Z
full work available at URL: https://arxiv.org/abs/1411.6852
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 05C85
zbMATH DE Number: 6482481
MaRDI profile type: Publication
OpenAlex ID: W1525471909
arXiv ID: 1411.6852
cites work: Faster algorithms for the shortest path problem
cites work: Q5417664
cites work: Optimal Listing of Cycles and st-Paths in Undirected Graphs
cites work: Q5397839
cites work: Generalized best-first search strategies and the optimality of A*
cites work: An Appraisal of Some Shortest-Path Algorithms
cites work: Finding the k Shortest Paths
cites work: On generating all maximal independent sets
cites work: Efficient Algorithms for Shortest Paths in Sparse Networks
cites work: An efficient algorithm for K shortest simple paths
cites work: A Procedure for Computing the K Best Solutions to Discrete Optimization Problems and Its Application to the Shortest Path Problem
cites work: The k most vital arcs in the shortest path problem
cites work: Amortized $\tilde{O}(|V|)$ -Delay Algorithm for Listing Chordless Cycles in Undirected Graphs
cites work: Q2934682
cites work: Automata, Languages and Programming
cites work: Finding the K Shortest Loopless Paths in a Network
description: scientific article