Finding paths in grids with forbidden transitions
DOI10.1007/978-3-662-53174-7_12zbMATH Open1417.05216OpenAlexW1483935858MaRDI QIDQ2827809FDOQ2827809
Authors: Mamadou Moustapha Kanté, Benjamin Momège, Nicolas Nisse, Fatima Zahra Moataz 
Publication date: 21 October 2016
Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-53174-7_12
Recommendations
- An exact algorithm to check the existence of (elementary) paths and a generalisation of the cut problem in graphs with forbidden transitions
- Finding paths in graphs avoiding forbidden transitions
- Simple Paths and Cycles Avoiding Forbidden Paths
- Shortest path-planning in road nets with forbidden routes
- A note on shortest path problems with forbidden paths
Programming involving graphs or networks (90C35) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Deterministic network models in operations research (90B10) Paths and cycles (05C38)
Cites Work
- The shortest path problem with forbidden paths
- Graph minors. II. Algorithmic aspects of tree-width
- On Embedding a Graph in the Grid with the Minimum Number of Bends
- Universality considerations in VLSI circuits
- Finding paths in graphs avoiding forbidden transitions
- Shortest path problem with forbidden paths: the elementary version
- Title not available (Why is that?)
- Algorithms – ESA 2005
- Complexity of trails, paths and circuits in arc-colored digraphs
- Labeling algorithm for the shortest path problem with turn prohibitions with application to large-scale road networks
- Dynamic programming and planarity: improved tree-decomposition based algorithms
- Finding paths in grids with forbidden transitions
- Shortest paths avoiding forbidden subpaths
Cited In (15)
- Reachability in choice networks
- Title not available (Why is that?)
- On the routing problems in graphs with ordered forbidden transitions
- On minimum connecting transition sets in graphs
- Domination problems with no conflicts
- An exact algorithm to check the existence of (elementary) paths and a generalisation of the cut problem in graphs with forbidden transitions
- Title not available (Why is that?)
- Introduction to routing problems with mandatory transitions
- Analyzing the reachability problem in choice networks
- Codon optimization by 0-1 linear programming
- On the complexity of independent dominating set with obligations in graphs
- Finding paths in graphs avoiding forbidden transitions
- Separating codes and traffic monitoring
- The complexity of routing problems in forbidden-transition graphs and edge-colored graphs
- Finding paths in grids with forbidden transitions
This page was built for publication: Finding paths in grids with forbidden transitions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2827809)
