Analyzing the reachability problem in choice networks

DOI10.1007/978-3-031-08011-1_27zbMATH Open1504.90178OpenAlexW4285179582MaRDI QIDQ2170221FDOQ2170221

Authors: Alvaro Velasquez, Piotr Wojciechowski, K. Subramani 

Publication date: 30 August 2022

Full work available at URL: https://doi.org/10.1007/978-3-031-08011-1_27

Recommendations

• The problems of selecting an optimal path on network
• scientific article; zbMATH DE number 1558116
• Publication:4726020
• Reachability in live and safe free-choice Petri nets is NP-complete
• scientific article

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Cites Work

• Network flows. Theory, algorithms, and applications.
• Title not available (Why is that?)
• Title not available (Why is that?)
• The Variance-Constrained Shortest Path Problem
• Parameterized Algorithms
• Faster algorithms for the shortest path problem
• Graph-Theoretic Concepts in Computer Science
• Title not available (Why is that?)
• Finding paths in graphs avoiding forbidden transitions
• Complexity of the path avoiding forbidden pairs problem revisited
• Shortest-path algorithms: Taxonomy and annotation
• An algorithm for the resource constrained shortest path problem
• On paths avoding forbidden pairs of vertices in a graph
• On the complexity of paths avoiding forbidden pairs
• Multi-criteria approximation schemes for the resource constrained shortest path problem
• Antistrong digraphs
• On finding shortest paths in arc-dependent networks
• Joint chance constrained shortest path problem with Copula theory
• An efficient exact approach for the constrained shortest path tour problem
• Finding Paths in Grids with Forbidden Transitions
• Finding read-once resolution refutations in systems of 2CNF clauses
• Some constrained shortest-route problems

This page was built for publication: Analyzing the reachability problem in choice networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2170221)