Finding Paths in Grids with Forbidden Transitions

DOI10.1007/978-3-662-53174-7_12zbMath1417.05216OpenAlexW1483935858MaRDI QIDQ2827809

Benjamin Momège, Mamadou Moustapha Kanté, 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

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Deterministic network models in operations research (90B10) Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (10)

Analyzing the reachability problem in choice networks ⋮ Codon optimization by 0-1 linear programming ⋮ Reachability in choice networks ⋮ Introduction to routing problems with mandatory transitions ⋮ Separating codes and traffic monitoring ⋮ The complexity of routing problems in forbidden-transition graphs and edge-colored graphs ⋮ Unnamed Item ⋮ Domination problems with no conflicts ⋮ Finding Paths in Grids with Forbidden Transitions ⋮ On the complexity of independent dominating set with obligations in graphs

Cites Work

• Unnamed Item
• The shortest path problem with forbidden paths
• 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 graphs avoiding forbidden transitions
• Complexity of trails, paths and circuits in arc-colored digraphs
• Shortest path problem with forbidden paths: the elementary version
• Finding Paths in Grids with Forbidden Transitions
• 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
• Shortest paths avoiding forbidden subpaths
• Algorithms – ESA 2005

This page was built for publication: Finding Paths in Grids with Forbidden Transitions