Shortest paths in reachability graphs
From MaRDI portal
Publication:1900935
DOI10.1006/JCSS.1995.1070zbMATH Open0831.68069OpenAlexW2081653724MaRDI QIDQ1900935FDOQ1900935
Authors: Jörg Desel, Javier Esparza 
Publication date: 25 October 1995
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jcss.1995.1070
Recommendations
- Lower and upper bounds of shortest paths in reachability graphs
- Approximating Shortest Paths in Graphs
- Shortest paths in almost acyclic graphs
- scientific article; zbMATH DE number 1182917
- Shortest paths in Euclidean graphs
- Shortest paths between shortest paths
- Shortest paths in distance-regular graphs
- Shortest paths in Sierpiński graphs
- Shortest paths on dynamic graphs
Graph theory (including graph drawing) in computer science (68R10) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cited In (9)
- Shortest path problems with node failures
- Reduction using induced subnets to systematically prove properties for free-choice nets
- Title not available (Why is that?)
- Shortest shortest path trees of a network
- An expansion property of Boolean linear maps
- Shortest Paths between Shortest Paths and Independent Sets
- Title not available (Why is that?)
- Lower and upper bounds of shortest paths in reachability graphs
- Regular marked Petri nets
This page was built for publication: Shortest paths in reachability graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1900935)
